Base | Representation |
---|---|
bin | 11110000000111101111… |
… | …00011011110100010100 |
3 | 10122120222212011210010220 |
4 | 33000132330123310110 |
5 | 113344111143410400 |
6 | 2105440004314340 |
7 | 134336566332261 |
oct | 17003674336424 |
9 | 3576885153126 |
10 | 1031311310100 |
11 | 368416391685 |
12 | 147a600a29b0 |
13 | 76338228876 |
14 | 37cb6ab8268 |
15 | 1bc605667a0 |
hex | f01ef1bd14 |
1031311310100 has 36 divisors (see below), whose sum is σ = 2983927391424. Its totient is φ = 275016349280.
The previous prime is 1031311310083. The next prime is 1031311310153. The reversal of 1031311310100 is 10131131301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1031311310100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1718851884 + ... + 1718852483.
It is an arithmetic number, because the mean of its divisors is an integer number (82886871984).
Almost surely, 21031311310100 is an apocalyptic number.
1031311310100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031311310100 is an abundant number, since it is smaller than the sum of its proper divisors (1952616081324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031311310100 is a wasteful number, since it uses less digits than its factorization.
1031311310100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437704384 (or 3437704377 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1031311310100 its reverse (10131131301), we get a palindrome (1041442441401).
The spelling of 1031311310100 in words is "one trillion, thirty-one billion, three hundred eleven million, three hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •