Base | Representation |
---|---|
bin | 1001001101110100110110… |
… | …1111110011111000000011 |
3 | 1022212201101102000021110011 |
4 | 2103131031233303320003 |
5 | 2312010123322331042 |
6 | 33315032514445351 |
7 | 2064044314544053 |
oct | 223351557637003 |
9 | 38781342007404 |
10 | 10133132230147 |
11 | 3257489a79003 |
12 | 1177a51593857 |
13 | 58671cc31174 |
14 | 2706365c1563 |
15 | 1288bcc69a17 |
hex | 9374dbf3e03 |
10133132230147 has 2 divisors, whose sum is σ = 10133132230148. Its totient is φ = 10133132230146.
The previous prime is 10133132230129. The next prime is 10133132230219. The reversal of 10133132230147 is 74103223133101.
It is a weak prime.
It is an emirp because it is prime and its reverse (74103223133101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10133132230147 - 27 = 10133132230019 is a prime.
It is not a weakly prime, because it can be changed into another prime (10133132231147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066566115073 + 5066566115074.
It is an arithmetic number, because the mean of its divisors is an integer number (5066566115074).
Almost surely, 210133132230147 is an apocalyptic number.
10133132230147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10133132230147 is an equidigital number, since it uses as much as digits as its factorization.
10133132230147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 31.
Adding to 10133132230147 its reverse (74103223133101), we get a palindrome (84236355363248).
The spelling of 10133132230147 in words is "ten trillion, one hundred thirty-three billion, one hundred thirty-two million, two hundred thirty thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •