Base | Representation |
---|---|
bin | 1001000110000101101111… |
… | …0000000110011011111111 |
3 | 1022102000022202020001001221 |
4 | 2101201123300012123333 |
5 | 2302320424114413043 |
6 | 33134012241014211 |
7 | 2051330565462166 |
oct | 221413360063377 |
9 | 38360282201057 |
10 | 10000223201023 |
11 | 3206086323280 |
12 | 115613a624367 |
13 | 57702b476c33 |
14 | 268028a303dd |
15 | 1251de8318ed |
hex | 9185bc066ff |
10000223201023 has 32 divisors (see below), whose sum is σ = 11057216002560. Its totient is φ = 8968574759040.
The previous prime is 10000223201009. The next prime is 10000223201027. The reversal of 10000223201023 is 32010232200001.
It is a cyclic number.
It is not a de Polignac number, because 10000223201023 - 213 = 10000223192831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000223200988 and 10000223201006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000223201027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1209358933 + ... + 1209367201.
It is an arithmetic number, because the mean of its divisors is an integer number (345538000080).
Almost surely, 210000223201023 is an apocalyptic number.
10000223201023 is a deficient number, since it is larger than the sum of its proper divisors (1056992801537).
10000223201023 is a wasteful number, since it uses less digits than its factorization.
10000223201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12319.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 10000223201023 its reverse (32010232200001), we get a palindrome (42010455401024).
The spelling of 10000223201023 in words is "ten trillion, two hundred twenty-three million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •