Base | Representation |
---|---|
bin | 11110010110001100110… |
… | …00001011010101001110 |
3 | 10200200102021102002110110 |
4 | 33023012120023111032 |
5 | 114040432314443040 |
6 | 2115003044420450 |
7 | 135222222262614 |
oct | 17130630132516 |
9 | 3620367362413 |
10 | 1042710312270 |
11 | 372235873730 |
12 | 14a1016a7726 |
13 | 77433a05573 |
14 | 3867896d6b4 |
15 | 1c1cb16d980 |
hex | f2c660b54e |
1042710312270 has 64 divisors (see below), whose sum is σ = 2756510175744. Its totient is φ = 250324091520.
The previous prime is 1042710312269. The next prime is 1042710312283. The reversal of 1042710312270 is 722130172401.
1042710312270 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 (30).
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, 15304497 + ... + 15372476.
It is an arithmetic number, because the mean of its divisors is an integer number (43070471496).
Almost surely, 21042710312270 is an apocalyptic number.
1042710312270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1042710312270 is an abundant number, since it is smaller than the sum of its proper divisors (1713799863474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042710312270 is a wasteful number, since it uses less digits than its factorization.
1042710312270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30677097.
The product of its (nonzero) digits is 4704, while the sum is 30.
Adding to 1042710312270 its reverse (722130172401), we get a palindrome (1764840484671).
The spelling of 1042710312270 in words is "one trillion, forty-two billion, seven hundred ten million, three hundred twelve thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •