Base | Representation |
---|---|
bin | 1010101010000011111001… |
… | …10001110100001010110100 |
3 | 10001222101221202111200112121 |
4 | 11111001330301310022310 |
5 | 11032431232330004000 |
6 | 121502031252525324 |
7 | 4636103632511245 |
oct | 525017461641264 |
9 | 101871852450477 |
10 | 23435435000500 |
11 | 7515a04108496 |
12 | 2765b3b920844 |
13 | 100cc4b820293 |
14 | 5b03d14d8ccc |
15 | 2a9921d2cb1a |
hex | 15507cc742b4 |
23435435000500 has 48 divisors (see below), whose sum is σ = 51231690514368. Its totient is φ = 9365254500000.
The previous prime is 23435435000491. The next prime is 23435435000569. The reversal of 23435435000500 is 500053453432.
It is a super-2 number, since 2×234354350005002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21772726 + ... + 22823725.
It is an arithmetic number, because the mean of its divisors is an integer number (1067326885716).
Almost surely, 223435435000500 is an apocalyptic number.
23435435000500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23435435000500 is an abundant number, since it is smaller than the sum of its proper divisors (27796255513868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23435435000500 is a wasteful number, since it uses less digits than its factorization.
23435435000500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44597521 (or 44597509 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 34.
Adding to 23435435000500 its reverse (500053453432), we get a palindrome (23935488453932).
The spelling of 23435435000500 in words is "twenty-three trillion, four hundred thirty-five billion, four hundred thirty-five million, five hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •