Base | Representation |
---|---|
bin | 1001001001100100111111… |
… | …01110000000011000100111 |
3 | 2122020111000202021111021112 |
4 | 10210302133232000120213 |
5 | 10114122341422431012 |
6 | 110443050254535235 |
7 | 4144433644005236 |
oct | 444623756003047 |
9 | 78214022244245 |
10 | 20120306452007 |
11 | 6457a79503083 |
12 | 230b549b0751b |
13 | b2c44bb17848 |
14 | 4d7b84176b1d |
15 | 24d596bc2122 |
hex | 124c9fb80627 |
20120306452007 has 4 divisors (see below), whose sum is σ = 20120502775560. Its totient is φ = 20120110128456.
The previous prime is 20120306451989. The next prime is 20120306452009. The reversal of 20120306452007 is 70025460302102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20120306452007 - 220 = 20120305403431 is a prime.
It is a super-3 number, since 3×201203064520073 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120306452009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98007968 + ... + 98213045.
It is an arithmetic number, because the mean of its divisors is an integer number (5030125693890).
Almost surely, 220120306452007 is an apocalyptic number.
20120306452007 is a deficient number, since it is larger than the sum of its proper divisors (196323553).
20120306452007 is a wasteful number, since it uses less digits than its factorization.
20120306452007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196323552.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 20120306452007 its reverse (70025460302102), we get a palindrome (90145766754109).
The spelling of 20120306452007 in words is "twenty trillion, one hundred twenty billion, three hundred six million, four hundred fifty-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •