Base | Representation |
---|---|
bin | 1010100111000101101010… |
… | …00111100100101000011110 |
3 | 10001121122022212101112210122 |
4 | 11103202311013210220132 |
5 | 11024243100024404042 |
6 | 121343100455034542 |
7 | 4625526644112020 |
oct | 523426507445036 |
9 | 101548285345718 |
10 | 23333301013022 |
11 | 748666313aa80 |
12 | 274a19736ba52 |
13 | 1003422b82a70 |
14 | 5a94a2ca2010 |
15 | 2a6e455b57d2 |
hex | 1538b51e4a1e |
23333301013022 has 128 divisors (see below), whose sum is σ = 47058084476928. Its totient is φ = 8379974361600.
The previous prime is 23333301013003. The next prime is 23333301013031. The reversal of 23333301013022 is 22031010333332.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 23333301012982 and 23333301013000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8342258528 + ... + 8342261324.
It is an arithmetic number, because the mean of its divisors is an integer number (367641284976).
Almost surely, 223333301013022 is an apocalyptic number.
23333301013022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
23333301013022 is an abundant number, since it is smaller than the sum of its proper divisors (23724783463906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23333301013022 is a wasteful number, since it uses less digits than its factorization.
23333301013022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7114.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 23333301013022 its reverse (22031010333332), we get a palindrome (45364311346354).
The spelling of 23333301013022 in words is "twenty-three trillion, three hundred thirty-three billion, three hundred one million, thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •