Base | Representation |
---|---|
bin | 1001001001110111001111… |
… | …10001000101001110011111 |
3 | 2122021102022122021001021110 |
4 | 10210323213301011032133 |
5 | 10114302423404334130 |
6 | 110451350451033103 |
7 | 4145231525411016 |
oct | 444734761051637 |
9 | 78242278231243 |
10 | 20130105152415 |
11 | 6461147627795 |
12 | 231142359b793 |
13 | b30350bb431b |
14 | 4d8433699a7d |
15 | 24d96c06aab0 |
hex | 124ee7c4539f |
20130105152415 has 32 divisors (see below), whose sum is σ = 34143903967680. Its totient is φ = 10092334454784.
The previous prime is 20130105152387. The next prime is 20130105152419. The reversal of 20130105152415 is 51425150103102.
It is not a de Polignac number, because 20130105152415 - 210 = 20130105151391 is a prime.
It is a super-2 number, since 2×201301051524152 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20130105152419) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47401144 + ... + 47823933.
It is an arithmetic number, because the mean of its divisors is an integer number (1066996998990).
Almost surely, 220130105152415 is an apocalyptic number.
20130105152415 is a deficient number, since it is larger than the sum of its proper divisors (14013798815265).
20130105152415 is a wasteful number, since it uses less digits than its factorization.
20130105152415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95225931.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 20130105152415 its reverse (51425150103102), we get a palindrome (71555255255517).
The spelling of 20130105152415 in words is "twenty trillion, one hundred thirty billion, one hundred five million, one hundred fifty-two thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •