Base | Representation |
---|---|
bin | 11110000000110100100… |
… | …10001000111111110100 |
3 | 10122120210102001000101202 |
4 | 33000122102020333310 |
5 | 113343431134122400 |
6 | 2105424132312032 |
7 | 134334626561510 |
oct | 17003222107764 |
9 | 3576712030352 |
10 | 1031233114100 |
11 | 368386232892 |
12 | 147a39a72618 |
13 | 76324c7a647 |
14 | 37caa561140 |
15 | 1bc5876c4d5 |
hex | f01a488ff4 |
1031233114100 has 36 divisors (see below), whose sum is σ = 2557458124704. Its totient is φ = 353565638880.
The previous prime is 1031233114097. The next prime is 1031233114111. The reversal of 1031233114100 is 14113321301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 736594382 + ... + 736595781.
It is an arithmetic number, because the mean of its divisors is an integer number (71040503464).
Almost surely, 21031233114100 is an apocalyptic number.
1031233114100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031233114100 is an abundant number, since it is smaller than the sum of its proper divisors (1526225010604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031233114100 is a wasteful number, since it uses less digits than its factorization.
1031233114100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1473190184 (or 1473190177 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1031233114100 its reverse (14113321301), we get a palindrome (1045346435401).
The spelling of 1031233114100 in words is "one trillion, thirty-one billion, two hundred thirty-three million, one hundred fourteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •