Base | Representation |
---|---|
bin | 110111111011010111… |
… | …0001100010110000000 |
3 | 102111000012202221212102 |
4 | 1233312232030112000 |
5 | 3431432433440222 |
6 | 131101425045532 |
7 | 11451163144160 |
oct | 1576656142600 |
9 | 374005687772 |
10 | 120103421312 |
11 | 46a32283086 |
12 | 1b33a4868a8 |
13 | b430758204 |
14 | 5b54d885a0 |
15 | 31ce0d3d92 |
hex | 1bf6b8c580 |
120103421312 has 128 divisors (see below), whose sum is σ = 290010300480. Its totient is φ = 48365568000.
The previous prime is 120103421287. The next prime is 120103421327. The reversal of 120103421312 is 213124301021.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9757562 + ... + 9769862.
Almost surely, 2120103421312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120103421312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145005150240).
120103421312 is an abundant number, since it is smaller than the sum of its proper divisors (169906879168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120103421312 is a wasteful number, since it uses less digits than its factorization.
120103421312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12980 (or 12968 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 120103421312 its reverse (213124301021), we get a palindrome (333227722333).
The spelling of 120103421312 in words is "one hundred twenty billion, one hundred three million, four hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •