Base | Representation |
---|---|
bin | 1010100111000000001000… |
… | …00111000001010011101100 |
3 | 10001121100122220100112220012 |
4 | 11103200010013001103230 |
5 | 11024221004303113400 |
6 | 121341450051512352 |
7 | 4625363234014535 |
oct | 523400407012354 |
9 | 101540586315805 |
10 | 23330331301100 |
11 | 74853798874aa |
12 | 27496a88b86b8 |
13 | 100306b844685 |
14 | 5a92a070168c |
15 | 2a6d1ea05d35 |
hex | 1538041c14ec |
23330331301100 has 18 divisors (see below), whose sum is σ = 50626818923604. Its totient is φ = 9332132520400.
The previous prime is 23330331301087. The next prime is 23330331301111. The reversal of 23330331301100 is 110313303332.
It is a super-2 number, since 2×233303313011002 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 116651656406 + ... + 116651656605.
Almost surely, 223330331301100 is an apocalyptic number.
23330331301100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23330331301100 is an abundant number, since it is smaller than the sum of its proper divisors (27296487622504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23330331301100 is a wasteful number, since it uses less digits than its factorization.
23330331301100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233303313025 (or 233303313018 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 23330331301100 its reverse (110313303332), we get a palindrome (23440644604432).
The spelling of 23330331301100 in words is "twenty-three trillion, three hundred thirty billion, three hundred thirty-one million, three hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •