Base | Representation |
---|---|
bin | 11110000000111111000… |
… | …10010010011011010110 |
3 | 10122121000112211220221210 |
4 | 33000133202102123112 |
5 | 113344121213424420 |
6 | 2105441001122250 |
7 | 134340046561320 |
oct | 17003742223326 |
9 | 3577015756853 |
10 | 1031321233110 |
11 | 368420a49a13 |
12 | 147a63489386 |
13 | 7633a2c137c |
14 | 37cb813c610 |
15 | 1bc613769e0 |
hex | f01f8926d6 |
1031321233110 has 64 divisors (see below), whose sum is σ = 2828852006400. Its totient is φ = 235723468032.
The previous prime is 1031321233109. The next prime is 1031321233199. The reversal of 1031321233110 is 113321231301.
It is a happy number.
1031321233110 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10520301 + ... + 10617879.
It is an arithmetic number, because the mean of its divisors is an integer number (44200812600).
Almost surely, 21031321233110 is an apocalyptic number.
1031321233110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1031321233110 is an abundant number, since it is smaller than the sum of its proper divisors (1797530773290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031321233110 is a wasteful number, since it uses less digits than its factorization.
1031321233110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147925.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1031321233110 its reverse (113321231301), we get a palindrome (1144642464411).
The spelling of 1031321233110 in words is "one trillion, thirty-one billion, three hundred twenty-one million, two hundred thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •