Base | Representation |
---|---|
bin | 1101000101001001100001… |
… | …10101001011011000111111 |
3 | 10202211211110121121212201112 |
4 | 12202210300311023120333 |
5 | 12232233103044243332 |
6 | 141102033102432235 |
7 | 6026101032215552 |
oct | 642446065133077 |
9 | 122754417555645 |
10 | 28764215227967 |
11 | 918a9206840aa |
12 | 328684559267b |
13 | 13085b918002b |
14 | 7162a4432699 |
15 | 34d3536e2db2 |
hex | 1a2930d4b63f |
28764215227967 has 4 divisors (see below), whose sum is σ = 28764342579336. Its totient is φ = 28764087876600.
The previous prime is 28764215227921. The next prime is 28764215228003. The reversal of 28764215227967 is 76972251246782.
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 28764215227967 - 212 = 28764215223871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28764215227897 and 28764215227906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28764215427967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63336284 + ... + 63788817.
It is an arithmetic number, because the mean of its divisors is an integer number (7191085644834).
Almost surely, 228764215227967 is an apocalyptic number.
28764215227967 is a deficient number, since it is larger than the sum of its proper divisors (127351369).
28764215227967 is a wasteful number, since it uses less digits than its factorization.
28764215227967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127351368.
The product of its digits is 284497920, while the sum is 68.
The spelling of 28764215227967 in words is "twenty-eight trillion, seven hundred sixty-four billion, two hundred fifteen million, two hundred twenty-seven thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •