Base | Representation |
---|---|
bin | 1010100001001101100101… |
… | …11001111001111111001100 |
3 | 10000220100012001210101101201 |
4 | 11100212302321321333030 |
5 | 11012441102001210012 |
6 | 121110230232315244 |
7 | 4605121444246324 |
oct | 520466271717714 |
9 | 100810161711351 |
10 | 23131400413132 |
11 | 7408a76553a70 |
12 | 271702b242b24 |
13 | cba387b7cc8b |
14 | 59d7cc5dc284 |
15 | 2a1a7a365857 |
hex | 1509b2e79fcc |
23131400413132 has 48 divisors (see below), whose sum is σ = 44218356779520. Its totient is φ = 10500374404800.
The previous prime is 23131400413049. The next prime is 23131400413151.
23131400413132 is nontrivially palindromic in base 10.
It is a super-3 number, since 3×231314004131323 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23131400413132.
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, 107082658 + ... + 107298454.
It is an arithmetic number, because the mean of its divisors is an integer number (921215766240).
Almost surely, 223131400413132 is an apocalyptic number.
23131400413132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23131400413132 is a deficient number, since it is larger than the sum of its proper divisors (21086956366388).
23131400413132 is a wasteful number, since it uses less digits than its factorization.
23131400413132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219022 (or 219020 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
It can be divided in two parts, 23131400 and 413132, that added together give a palindrome (23544532).
The spelling of 23131400413132 in words is "twenty-three trillion, one hundred thirty-one billion, four hundred million, four hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •