Base | Representation |
---|---|
bin | 1010101101010000110100… |
… | …01100001111001000100010 |
3 | 10002100220220220101102102200 |
4 | 11112220122030033020202 |
5 | 11041232040213211002 |
6 | 122024344102554030 |
7 | 4650050126633001 |
oct | 526503214171042 |
9 | 102326826342380 |
10 | 23545450132002 |
11 | 7558629853077 |
12 | 2783323738916 |
13 | 101a4321b7626 |
14 | 5b586a6dac38 |
15 | 2ac710413b1c |
hex | 156a1a30f222 |
23545450132002 has 48 divisors (see below), whose sum is σ = 51200812835640. Its totient is φ = 7819949846016.
The previous prime is 23545450131971. The next prime is 23545450132007. The reversal of 23545450132002 is 20023105454532.
23545450132002 is a `hidden beast` number, since 2 + 35 + 45 + 450 + 132 + 0 + 0 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 23502144105801 + 43306026201 = 4847901^2 + 208101^2 .
It is not an unprimeable number, because it can be changed into a prime (23545450132007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7756624 + ... + 10356452.
Almost surely, 223545450132002 is an apocalyptic number.
23545450132002 is an abundant number, since it is smaller than the sum of its proper divisors (27655362703638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23545450132002 is a wasteful number, since it uses less digits than its factorization.
23545450132002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2601667 (or 2601664 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 36.
Adding to 23545450132002 its reverse (20023105454532), we get a palindrome (43568555586534).
The spelling of 23545450132002 in words is "twenty-three trillion, five hundred forty-five billion, four hundred fifty million, one hundred thirty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •