Base | Representation |
---|---|
bin | 1110011011101100… |
… | …1000100100011000 |
3 | 101000000002212100020 |
4 | 3212323020210120 |
5 | 30413302330042 |
6 | 1440234510440 |
7 | 165002451240 |
oct | 34673104430 |
9 | 11000085306 |
10 | 3874261272 |
11 | 1708a12922 |
12 | 901595420 |
13 | 4998686bb |
14 | 28a782b20 |
15 | 17a1d93ec |
hex | e6ec8918 |
3874261272 has 64 divisors (see below), whose sum is σ = 11651923200. Its totient is φ = 1048671360.
The previous prime is 3874261271. The next prime is 3874261337. The reversal of 3874261272 is 2721624783.
It is a happy number.
It is a super-3 number, since 3×38742612723 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3874261271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 603679 + ... + 610062.
It is an arithmetic number, because the mean of its divisors is an integer number (182061300).
Almost surely, 23874261272 is an apocalyptic number.
It is an amenable number.
3874261272 is an abundant number, since it is smaller than the sum of its proper divisors (7777661928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3874261272 is a wasteful number, since it uses less digits than its factorization.
3874261272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213776 (or 1213772 counting only the distinct ones).
The product of its digits is 225792, while the sum is 42.
The square root of 3874261272 is about 62243.5641010378. The cubic root of 3874261272 is about 1570.5905079880.
The spelling of 3874261272 in words is "three billion, eight hundred seventy-four million, two hundred sixty-one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •