Base | Representation |
---|---|
bin | 1010100110011100101011… |
… | …11100100111110100110100 |
3 | 10001112112112210122111020001 |
4 | 11103032111330213310310 |
5 | 11023413022110243330 |
6 | 121325022001521044 |
7 | 4624120552643233 |
oct | 523162574476464 |
9 | 101475483574201 |
10 | 23311303212340 |
11 | 74782a4a36810 |
12 | 2745a78343184 |
13 | 1001328620b60 |
14 | 5a83b7534b1a |
15 | 2a65a926d9ca |
hex | 153395f27d34 |
23311303212340 has 48 divisors (see below), whose sum is σ = 57512082337920. Its totient is φ = 7824773105280.
The previous prime is 23311303212269. The next prime is 23311303212359. The reversal of 23311303212340 is 4321230311332.
It is a junction number, because it is equal to n+sod(n) for n = 23311303212299 and 23311303212308.
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, 4075399800 + ... + 4075405519.
It is an arithmetic number, because the mean of its divisors is an integer number (1198168382040).
Almost surely, 223311303212340 is an apocalyptic number.
23311303212340 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23311303212340 is an abundant number, since it is smaller than the sum of its proper divisors (34200779125580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23311303212340 is a wasteful number, since it uses less digits than its factorization.
23311303212340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8150805352 (or 8150805350 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 23311303212340 its reverse (4321230311332), we get a palindrome (27632533523672).
The spelling of 23311303212340 in words is "twenty-three trillion, three hundred eleven billion, three hundred three million, two hundred twelve thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •