Base | Representation |
---|---|
bin | 1110000110111000111000… |
… | …01101101010010000110000 |
3 | 11001211202211202022011021112 |
4 | 13003130130031222100300 |
5 | 13031240122130401112 |
6 | 145551440221412452 |
7 | 6351224260062443 |
oct | 703343415522060 |
9 | 131752752264245 |
10 | 31023022122032 |
11 | 9980876245a86 |
12 | 359057740a128 |
13 | 14405c62411b5 |
14 | 7937451dd65a |
15 | 38bea776ea22 |
hex | 1c371c36a430 |
31023022122032 has 20 divisors (see below), whose sum is σ = 62720457769200. Its totient is φ = 14837097536448.
The previous prime is 31023022122031. The next prime is 31023022122047. The reversal of 31023022122032 is 23022122032013.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 31023022121989 and 31023022122007.
It is not an unprimeable number, because it can be changed into a prime (31023022122031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42150844907 + ... + 42150845642.
It is an arithmetic number, because the mean of its divisors is an integer number (3136022888460).
Almost surely, 231023022122032 is an apocalyptic number.
It is an amenable number.
31023022122032 is an abundant number, since it is smaller than the sum of its proper divisors (31697435647168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31023022122032 is a wasteful number, since it uses less digits than its factorization.
31023022122032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84301690580 (or 84301690574 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 31023022122032 its reverse (23022122032013), we get a palindrome (54045144154045).
The spelling of 31023022122032 in words is "thirty-one trillion, twenty-three billion, twenty-two million, one hundred twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •