Base | Representation |
---|---|
bin | 110111111111011101… |
… | …1000101110001111111 |
3 | 102111100210200200211021 |
4 | 1233332323011301333 |
5 | 3432223200120111 |
6 | 131123222205011 |
7 | 11454453543466 |
oct | 1577673056177 |
9 | 374323620737 |
10 | 120241020031 |
11 | 46aa2a15030 |
12 | 1b378583767 |
13 | b453104582 |
14 | 5b693659dd |
15 | 31db213d71 |
hex | 1bfeec5c7f |
120241020031 has 16 divisors (see below), whose sum is σ = 131358314880. Its totient is φ = 109154913120.
The previous prime is 120241019993. The next prime is 120241020037. The reversal of 120241020031 is 130020142021.
It is not a de Polignac number, because 120241020031 - 27 = 120241019903 is a prime.
It is a super-2 number, since 2×1202410200312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120241019987 and 120241020014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120241020037) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40579356 + ... + 40582318.
It is an arithmetic number, because the mean of its divisors is an integer number (8209894680).
Almost surely, 2120241020031 is an apocalyptic number.
120241020031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120241020031 is a deficient number, since it is larger than the sum of its proper divisors (11117294849).
120241020031 is a wasteful number, since it uses less digits than its factorization.
120241020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6966.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 120241020031 its reverse (130020142021), we get a palindrome (250261162052).
The spelling of 120241020031 in words is "one hundred twenty billion, two hundred forty-one million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •