Base | Representation |
---|---|
bin | 10010101111010001… |
… | …01101011110001101 |
3 | 221222010002100110121 |
4 | 21113220231132031 |
5 | 131100404140042 |
6 | 4342133304541 |
7 | 504205332166 |
oct | 112750553615 |
9 | 27863070417 |
10 | 10060224397 |
11 | 42a2809543 |
12 | 1b49195151 |
13 | c44315602 |
14 | 6b615c76d |
15 | 3dd307367 |
hex | 257a2d78d |
10060224397 has 2 divisors, whose sum is σ = 10060224398. Its totient is φ = 10060224396.
The previous prime is 10060224373. The next prime is 10060224437. The reversal of 10060224397 is 79342206001.
10060224397 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8549036521 + 1511187876 = 92461^2 + 38874^2 .
It is a cyclic number.
It is not a de Polignac number, because 10060224397 - 211 = 10060222349 is a prime.
It is a super-2 number, since 2×100602243972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10060224197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5030112198 + 5030112199.
It is an arithmetic number, because the mean of its divisors is an integer number (5030112199).
Almost surely, 210060224397 is an apocalyptic number.
It is an amenable number.
10060224397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10060224397 is an equidigital number, since it uses as much as digits as its factorization.
10060224397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 34.
The spelling of 10060224397 in words is "ten billion, sixty million, two hundred twenty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •