Base | Representation |
---|---|
bin | 111010010010110… |
… | …1110011000000100 |
3 | 12001022122110010202 |
4 | 1310211232120010 |
5 | 13001221440330 |
6 | 522032510032 |
7 | 66321056003 |
oct | 16445563004 |
9 | 5038573122 |
10 | 1956046340 |
11 | 914156626 |
12 | 4670ab318 |
13 | 252328091 |
14 | 147ad6c3a |
15 | b6ace445 |
hex | 7496e604 |
1956046340 has 24 divisors (see below), whose sum is σ = 4108538112. Its totient is φ = 782258400.
The previous prime is 1956046331. The next prime is 1956046343. The reversal of 1956046340 is 436406591.
It is a super-3 number, since 3×19560463403 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1956046294 and 1956046303.
It is not an unprimeable number, because it can be changed into a prime (1956046343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 163565 + ... + 175115.
It is an arithmetic number, because the mean of its divisors is an integer number (171189088).
Almost surely, 21956046340 is an apocalyptic number.
1956046340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1956046340 is an abundant number, since it is smaller than the sum of its proper divisors (2152491772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1956046340 is a wasteful number, since it uses less digits than its factorization.
1956046340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20027 (or 20025 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 38.
The square root of 1956046340 is about 44227.2126636984. The cubic root of 1956046340 is about 1250.6229087362.
The spelling of 1956046340 in words is "one billion, nine hundred fifty-six million, forty-six thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •