Base | Representation |
---|---|
bin | 1010100110110110111101… |
… | …00100100011001101001100 |
3 | 10001120212221200112210112220 |
4 | 11103123132210203031030 |
5 | 11024130413033244440 |
6 | 121335313245055340 |
7 | 4625130214155342 |
oct | 523333644431514 |
9 | 101525850483486 |
10 | 23325406540620 |
11 | 748328199a018 |
12 | 2748753557550 |
13 | 100276546a412 |
14 | 5a8d54627992 |
15 | 2a6b324b28d0 |
hex | 1536de92334c |
23325406540620 has 48 divisors (see below), whose sum is σ = 65382830166528. Its totient is φ = 6213280615360.
The previous prime is 23325406540619. The next prime is 23325406540661. The reversal of 23325406540620 is 2604560452332.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 213313494 + ... + 213422813.
It is an arithmetic number, because the mean of its divisors is an integer number (1362142295136).
Almost surely, 223325406540620 is an apocalyptic number.
23325406540620 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23325406540620 is an abundant number, since it is smaller than the sum of its proper divisors (42057423625908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23325406540620 is a wasteful number, since it uses less digits than its factorization.
23325406540620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426737230 (or 426737228 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 42.
Adding to 23325406540620 its reverse (2604560452332), we get a palindrome (25929966992952).
The spelling of 23325406540620 in words is "twenty-three trillion, three hundred twenty-five billion, four hundred six million, five hundred forty thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •