Base | Representation |
---|---|
bin | 1001000111110100101011… |
… | …0101000001010111110101 |
3 | 1022111212012020010212221011 |
4 | 2101331022311001113311 |
5 | 2303312422014040042 |
6 | 33155415323552221 |
7 | 2053433564510053 |
oct | 221751265012765 |
9 | 38455166125834 |
10 | 10030004049397 |
11 | 3217778893462 |
12 | 115ba7008b671 |
13 | 579a9630a7c7 |
14 | 269651d0d1d3 |
15 | 125d840bba17 |
hex | 91f4ad415f5 |
10030004049397 has 2 divisors, whose sum is σ = 10030004049398. Its totient is φ = 10030004049396.
The previous prime is 10030004049389. The next prime is 10030004049433. The reversal of 10030004049397 is 79394040003001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10024860434436 + 5143614961 = 3166206^2 + 71719^2 .
It is an emirp because it is prime and its reverse (79394040003001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10030004049397 - 23 = 10030004049389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10030004049367) 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 as a sum of consecutive naturals, namely, 5015002024698 + 5015002024699.
It is an arithmetic number, because the mean of its divisors is an integer number (5015002024699).
Almost surely, 210030004049397 is an apocalyptic number.
It is an amenable number.
10030004049397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10030004049397 is an equidigital number, since it uses as much as digits as its factorization.
10030004049397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 40.
The spelling of 10030004049397 in words is "ten trillion, thirty billion, four million, forty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •