Base | Representation |
---|---|
bin | 110111111000100101… |
… | …1000011010010101010 |
3 | 102110202201121002011000 |
4 | 1233301023003102222 |
5 | 3431240120314424 |
6 | 131044301415430 |
7 | 11445652625643 |
oct | 1576113032252 |
9 | 373681532130 |
10 | 120010323114 |
11 | 46994776020 |
12 | 1b31326a576 |
13 | b417390016 |
14 | 5b468726ca |
15 | 31c5d443c9 |
hex | 1bf12c34aa |
120010323114 has 64 divisors (see below), whose sum is σ = 291160298880. Its totient is φ = 36338492160.
The previous prime is 120010323071. The next prime is 120010323127. The reversal of 120010323114 is 411323010021.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 31 ways as a sum of consecutive naturals, for example, 692532 + ... + 848304.
It is an arithmetic number, because the mean of its divisors is an integer number (4549379670).
Almost surely, 2120010323114 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120010323114, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145580149440).
120010323114 is an abundant number, since it is smaller than the sum of its proper divisors (171149975766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120010323114 is a wasteful number, since it uses less digits than its factorization.
120010323114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157092 (or 157086 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 120010323114 its reverse (411323010021), we get a palindrome (531333333135).
The spelling of 120010323114 in words is "one hundred twenty billion, ten million, three hundred twenty-three thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •