Base | Representation |
---|---|
bin | 100001100010100010… |
… | …1110100100000000011 |
3 | 20212220121211200211202 |
4 | 1003011011310200003 |
5 | 2140002141122201 |
6 | 53031025331415 |
7 | 5126605603463 |
oct | 1030505644003 |
9 | 225817750752 |
10 | 72026114051 |
11 | 286009555a1 |
12 | 11b61496b6b |
13 | 6a3b135cc8 |
14 | 36b3b4bba3 |
15 | 1d18430c6b |
hex | 10c5174803 |
72026114051 has 4 divisors (see below), whose sum is σ = 72028320000. Its totient is φ = 72023908104.
The previous prime is 72026113963. The next prime is 72026114053. The reversal of 72026114051 is 15041162027.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15041162027 = 281 ⋅53527267.
It is a cyclic number.
It is not a de Polignac number, because 72026114051 - 214 = 72026097667 is a prime.
It is a super-2 number, since 2×720261140512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (72026114053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1053251 + ... + 1119548.
It is an arithmetic number, because the mean of its divisors is an integer number (18007080000).
Almost surely, 272026114051 is an apocalyptic number.
72026114051 is a deficient number, since it is larger than the sum of its proper divisors (2205949).
72026114051 is a wasteful number, since it uses less digits than its factorization.
72026114051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2205948.
The product of its (nonzero) digits is 3360, while the sum is 29.
Adding to 72026114051 its reverse (15041162027), we get a palindrome (87067276078).
The spelling of 72026114051 in words is "seventy-two billion, twenty-six million, one hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •