Base | Representation |
---|---|
bin | 1001010111100110111101… |
… | …1000010101010010011000 |
3 | 1100110210012100121001100021 |
4 | 2111321233120111102120 |
5 | 2322233324224203212 |
6 | 33524150035120224 |
7 | 2112144226124314 |
oct | 225715730252230 |
9 | 40423170531307 |
10 | 10301200225432 |
11 | 3311794a80466 |
12 | 11a4537143074 |
13 | 59952582a09c |
14 | 27881b81cb44 |
15 | 12ce57b84307 |
hex | 95e6f615498 |
10301200225432 has 32 divisors (see below), whose sum is σ = 19690936473600. Its totient is φ = 5050973293344.
The previous prime is 10301200225427. The next prime is 10301200225453. The reversal of 10301200225432 is 23452200210301.
10301200225432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103012002254322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10301200225397 and 10301200225406.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42971632 + ... + 43210687.
It is an arithmetic number, because the mean of its divisors is an integer number (615341764800).
Almost surely, 210301200225432 is an apocalyptic number.
It is an amenable number.
10301200225432 is a deficient number, since it is larger than the sum of its proper divisors (9389736248168).
10301200225432 is a wasteful number, since it uses less digits than its factorization.
10301200225432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86182615 (or 86182611 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 10301200225432 its reverse (23452200210301), we get a palindrome (33753400435733).
The spelling of 10301200225432 in words is "ten trillion, three hundred one billion, two hundred million, two hundred twenty-five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •