Base | Representation |
---|---|
bin | 1001000111110101011100… |
… | …1111000011011100011111 |
3 | 1022111212201201211001012000 |
4 | 2101331113033003130133 |
5 | 2303313333310401343 |
6 | 33155452121213343 |
7 | 2053442002662555 |
oct | 221752717033437 |
9 | 38455651731160 |
10 | 10030212200223 |
11 | 3217875333236 |
12 | 115bb09931253 |
13 | 579aca489a87 |
14 | 269671813bd5 |
15 | 125d974d5ed3 |
hex | 91f573c371f |
10030212200223 has 16 divisors (see below), whose sum is σ = 14923348633440. Its totient is φ = 6658109381952.
The previous prime is 10030212200179. The next prime is 10030212200227. The reversal of 10030212200223 is 32200221203001.
10030212200223 is a `hidden beast` number, since 1 + 0 + 0 + 30 + 212 + 200 + 223 = 666.
It is not a de Polignac number, because 10030212200223 - 217 = 10030212069151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10030212200196 and 10030212200205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030212200227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 797181136 + ... + 797193717.
It is an arithmetic number, because the mean of its divisors is an integer number (932709289590).
Almost surely, 210030212200223 is an apocalyptic number.
10030212200223 is a deficient number, since it is larger than the sum of its proper divisors (4893136433217).
10030212200223 is a wasteful number, since it uses less digits than its factorization.
10030212200223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1594375095 (or 1594375089 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 10030212200223 its reverse (32200221203001), we get a palindrome (42230433403224).
The spelling of 10030212200223 in words is "ten trillion, thirty billion, two hundred twelve million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •