Base | Representation |
---|---|
bin | 1001010011011110111000… |
… | …0111101110001010101011 |
3 | 1100020000020001010212002011 |
4 | 2110313232013232022223 |
5 | 2320103134401231131 |
6 | 33431423541220351 |
7 | 2104054446232615 |
oct | 224675607561253 |
9 | 40200201125064 |
10 | 10230312133291 |
11 | 329471854a648 |
12 | 1192852a016b7 |
13 | 5929393c8133 |
14 | 275214ca9db5 |
15 | 12b1a95ea0b1 |
hex | 94dee1ee2ab |
10230312133291 has 8 divisors (see below), whose sum is σ = 10306629912384. Its totient is φ = 10154271370560.
The previous prime is 10230312133267. The next prime is 10230312133333. The reversal of 10230312133291 is 19233121303201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10230312133291 - 29 = 10230312132779 is a prime.
It is a super-2 number, since 2×102303121332912 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10230312133211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69179955 + ... + 69327676.
It is an arithmetic number, because the mean of its divisors is an integer number (1288328739048).
Almost surely, 210230312133291 is an apocalyptic number.
10230312133291 is a deficient number, since it is larger than the sum of its proper divisors (76317779093).
10230312133291 is a wasteful number, since it uses less digits than its factorization.
10230312133291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138508181.
The product of its (nonzero) digits is 5832, while the sum is 31.
Adding to 10230312133291 its reverse (19233121303201), we get a palindrome (29463433436492).
The spelling of 10230312133291 in words is "ten trillion, two hundred thirty billion, three hundred twelve million, one hundred thirty-three thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •