Base | Representation |
---|---|
bin | 1001100111100111101010… |
… | …00010011101111000101011 |
3 | 2202220011101012001021212201 |
4 | 10303303311002131320223 |
5 | 10233030340141430443 |
6 | 112553201012321031 |
7 | 4312135261443202 |
oct | 463636502357053 |
9 | 82804335037781 |
10 | 21152530030123 |
11 | 6815812836168 |
12 | 2457603613177 |
13 | ba58a1043a6b |
14 | 531b06082239 |
15 | 26a35c38a34d |
hex | 133cf509de2b |
21152530030123 has 32 divisors (see below), whose sum is σ = 23680138959360. Its totient is φ = 18800061096960.
The previous prime is 21152530030109. The next prime is 21152530030139. The reversal of 21152530030123 is 32103003525112.
It is not a de Polignac number, because 21152530030123 - 25 = 21152530030091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21152530030091 and 21152530030100.
It is not an unprimeable number, because it can be changed into a prime (21152530000123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 70282440 + ... + 70582762.
It is an arithmetic number, because the mean of its divisors is an integer number (740004342480).
Almost surely, 221152530030123 is an apocalyptic number.
21152530030123 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
21152530030123 is a deficient number, since it is larger than the sum of its proper divisors (2527608929237).
21152530030123 is a wasteful number, since it uses less digits than its factorization.
21152530030123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303459.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 21152530030123 its reverse (32103003525112), we get a palindrome (53255533555235).
The spelling of 21152530030123 in words is "twenty-one trillion, one hundred fifty-two billion, five hundred thirty million, thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •