Base | Representation |
---|---|
bin | 10111001100101000011100… |
… | …100110011111001000011111 |
3 | 111101020022112112222112211211 |
4 | 113030220130212133020133 |
5 | 101333021334022001343 |
6 | 1000552440312125251 |
7 | 30326633225664541 |
oct | 2714503446371037 |
9 | 441208475875754 |
10 | 102023133000223 |
11 | 2a564849928466 |
12 | b538924996827 |
13 | 44c0981195716 |
14 | 1b29d35ad1691 |
15 | bbdcc85ce79d |
hex | 5cca1c99f21f |
102023133000223 has 16 divisors (see below), whose sum is σ = 111507242704704. Its totient is φ = 92952342443520.
The previous prime is 102023133000203. The next prime is 102023133000287. The reversal of 102023133000223 is 322000331320201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102023133000223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102023133000194 and 102023133000203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102023133000203) 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, 411548523 + ... + 411796348.
It is an arithmetic number, because the mean of its divisors is an integer number (6969202669044).
Almost surely, 2102023133000223 is an apocalyptic number.
102023133000223 is a deficient number, since it is larger than the sum of its proper divisors (9484109704481).
102023133000223 is a wasteful number, since it uses less digits than its factorization.
102023133000223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 823345122.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 102023133000223 its reverse (322000331320201), we get a palindrome (424023464320424).
The spelling of 102023133000223 in words is "one hundred two trillion, twenty-three billion, one hundred thirty-three million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •