Base | Representation |
---|---|
bin | 1010100100110010001110… |
… | …00101010001110000000010 |
3 | 10001100002000101100011210201 |
4 | 11102121013011101300002 |
5 | 11021443442222200211 |
6 | 121242450145515414 |
7 | 4620025255314661 |
oct | 522310705216002 |
9 | 101302011304721 |
10 | 23254145506306 |
11 | 74560339a4230 |
12 | 2736986342b6a |
13 | cc8b199ab920 |
14 | 5a5714354dd8 |
15 | 2a4d6130c0c1 |
hex | 152647151c02 |
23254145506306 has 128 divisors (see below), whose sum is σ = 43896345292800. Its totient is φ = 9086380934400.
The previous prime is 23254145506303. The next prime is 23254145506309. The reversal of 23254145506306 is 60360554145232.
It is an interprime number because it is at equal distance from previous prime (23254145506303) and next prime (23254145506309).
It is a Harshad number since it is a multiple of its sum of digits (46).
It is not an unprimeable number, because it can be changed into a prime (23254145506303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 87835420 + ... + 88099768.
It is an arithmetic number, because the mean of its divisors is an integer number (342940197600).
Almost surely, 223254145506306 is an apocalyptic number.
23254145506306 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
23254145506306 is a deficient number, since it is larger than the sum of its proper divisors (20642199786494).
23254145506306 is a wasteful number, since it uses less digits than its factorization.
23254145506306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264752.
The product of its (nonzero) digits is 2592000, while the sum is 46.
The spelling of 23254145506306 in words is "twenty-three trillion, two hundred fifty-four billion, one hundred forty-five million, five hundred six thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •