Base | Representation |
---|---|
bin | 11101011001101100111… |
… | …11010110110011111000 |
3 | 10120120120202210200120002 |
4 | 32230312133112303320 |
5 | 113022423231112440 |
6 | 2052032143052132 |
7 | 132662323050056 |
oct | 16546637266370 |
9 | 3516522720502 |
10 | 1010231504120 |
11 | 35a489390423 |
12 | 1439585a1048 |
13 | 74358c20aa7 |
14 | 36c7722d1d6 |
15 | 1b429b03115 |
hex | eb367d6cf8 |
1010231504120 has 32 divisors (see below), whose sum is σ = 2295526050720. Its totient is φ = 400091683200.
The previous prime is 1010231504069. The next prime is 1010231504131. The reversal of 1010231504120 is 214051320101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1010231504092 and 1010231504101.
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, 125024612 + ... + 125032691.
It is an arithmetic number, because the mean of its divisors is an integer number (71735189085).
Almost surely, 21010231504120 is an apocalyptic number.
1010231504120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010231504120 is an abundant number, since it is smaller than the sum of its proper divisors (1285294546600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010231504120 is a wasteful number, since it uses less digits than its factorization.
1010231504120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250057415 (or 250057411 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 1010231504120 its reverse (214051320101), we get a palindrome (1224282824221).
The spelling of 1010231504120 in words is "one trillion, ten billion, two hundred thirty-one million, five hundred four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •