Base | Representation |
---|---|
bin | 1001001101110100011100… |
… | …1111111011110111111001 |
3 | 1022212201002210212112022000 |
4 | 2103131013033323313321 |
5 | 2312004412420223001 |
6 | 33315014022051213 |
7 | 2064041522106015 |
oct | 223350717736771 |
9 | 38781083775260 |
10 | 10133023211001 |
11 | 3257433487339 |
12 | 1177a20b79b09 |
13 | 5867034803b2 |
14 | 270625d23545 |
15 | 1288b33d2a86 |
hex | 937473fbdf9 |
10133023211001 has 64 divisors (see below), whose sum is σ = 15557418297600. Its totient is φ = 6515445454848.
The previous prime is 10133023210997. The next prime is 10133023211009. The reversal of 10133023211001 is 10011232033101.
10133023211001 is a `hidden beast` number, since 1 + 0 + 1 + 330 + 2 + 321 + 10 + 0 + 1 = 666.
It is not a de Polignac number, because 10133023211001 - 22 = 10133023210997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10133023211009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17811765 + ... + 18371853.
It is an arithmetic number, because the mean of its divisors is an integer number (243084660900).
Almost surely, 210133023211001 is an apocalyptic number.
It is an amenable number.
10133023211001 is a deficient number, since it is larger than the sum of its proper divisors (5424395086599).
10133023211001 is a wasteful number, since it uses less digits than its factorization.
10133023211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560375 (or 560369 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10133023211001 its reverse (10011232033101), we get a palindrome (20144255244102).
The spelling of 10133023211001 in words is "ten trillion, one hundred thirty-three billion, twenty-three million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •