Base | Representation |
---|---|
bin | 110111111000100101… |
… | …1011001010000010110 |
3 | 102110202201202122120000 |
4 | 1233301023121100112 |
5 | 3431240131204303 |
6 | 131044303352130 |
7 | 11445653452143 |
oct | 1576113312026 |
9 | 373681678500 |
10 | 120010413078 |
11 | 46994827676 |
12 | 1b3132b2646 |
13 | b4173c1c5a |
14 | 5b468973ca |
15 | 31c5d60da3 |
hex | 1bf12d9416 |
120010413078 has 20 divisors (see below), whose sum is σ = 268912222260. Its totient is φ = 40003470972.
The previous prime is 120010413073. The next prime is 120010413109. The reversal of 120010413078 is 870314010021.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120010413073) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 370402348 + ... + 370402671.
It is an arithmetic number, because the mean of its divisors is an integer number (13445611113).
Almost surely, 2120010413078 is an apocalyptic number.
120010413078 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
120010413078 is an abundant number, since it is smaller than the sum of its proper divisors (148901809182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120010413078 is an equidigital number, since it uses as much as digits as its factorization.
120010413078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740805033 (or 740805024 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
Adding to 120010413078 its reverse (870314010021), we get a palindrome (990324423099).
The spelling of 120010413078 in words is "one hundred twenty billion, ten million, four hundred thirteen thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •