Base | Representation |
---|---|
bin | 1001000110110001101001… |
… | …1111000000010010001111 |
3 | 1022110010202102000002001100 |
4 | 2101230122133000102033 |
5 | 2303014100323232343 |
6 | 33143242203314143 |
7 | 2052226006131036 |
oct | 221543237002217 |
9 | 38403672002040 |
10 | 10012013102223 |
11 | 3210086424580 |
12 | 115848ab1b953 |
13 | 578189c29932 |
14 | 26882679b71d |
15 | 12567e9009d3 |
hex | 91b1a7c048f |
10012013102223 has 48 divisors (see below), whose sum is σ = 15902739021312. Its totient is φ = 6019369200000.
The previous prime is 10012013102207. The next prime is 10012013102237. The reversal of 10012013102223 is 32220131021001.
10012013102223 is a `hidden beast` number, since 10 + 0 + 120 + 1 + 310 + 2 + 223 = 666.
It is not a de Polignac number, because 10012013102223 - 24 = 10012013102207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10012013102196 and 10012013102205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012013106223) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35745723 + ... + 36024723.
It is an arithmetic number, because the mean of its divisors is an integer number (331307062944).
Almost surely, 210012013102223 is an apocalyptic number.
10012013102223 is a deficient number, since it is larger than the sum of its proper divisors (5890725919089).
10012013102223 is a wasteful number, since it uses less digits than its factorization.
10012013102223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281916 (or 281913 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10012013102223 its reverse (32220131021001), we get a palindrome (42232144123224).
The spelling of 10012013102223 in words is "ten trillion, twelve billion, thirteen million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •