Base | Representation |
---|---|
bin | 11011010110110010011111… |
… | …100001101101101111111000 |
3 | 120202222211122202120212102212 |
4 | 123112302133201231233320 |
5 | 111232203114334423112 |
6 | 1103515100033514252 |
7 | 34225230511660523 |
oct | 3326623741555770 |
9 | 522884582525385 |
10 | 120313300311032 |
11 | 35376647511aa4 |
12 | 115b1634a12988 |
13 | 52196599067ba |
14 | 219d2a2791bba |
15 | dd99597d7522 |
hex | 6d6c9f86dbf8 |
120313300311032 has 64 divisors (see below), whose sum is σ = 231211117440000. Its totient is φ = 58673899171456.
The previous prime is 120313300311031. The next prime is 120313300311037. The reversal of 120313300311032 is 230113003313021.
It is a junction number, because it is equal to n+sod(n) for n = 120313300310989 and 120313300311007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120313300311031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61416593 + ... + 63345279.
It is an arithmetic number, because the mean of its divisors is an integer number (3612673710000).
Almost surely, 2120313300311032 is an apocalyptic number.
It is an amenable number.
120313300311032 is a deficient number, since it is larger than the sum of its proper divisors (110897817128968).
120313300311032 is a wasteful number, since it uses less digits than its factorization.
120313300311032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1929788 (or 1929784 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 120313300311032 its reverse (230113003313021), we get a palindrome (350426303624053).
The spelling of 120313300311032 in words is "one hundred twenty trillion, three hundred thirteen billion, three hundred million, three hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •