Base | Representation |
---|---|
bin | 10111100000110101… |
… | …00101100001111010 |
3 | 1012120202012222121220 |
4 | 23300122211201322 |
5 | 201323044422043 |
6 | 5444340012510 |
7 | 624551302053 |
oct | 136032454172 |
9 | 35522188556 |
10 | 12623435898 |
11 | 5398667257 |
12 | 2543691136 |
13 | 12623776c8 |
14 | 87a74572a |
15 | 4dd36c483 |
hex | 2f06a587a |
12623435898 has 16 divisors (see below), whose sum is σ = 25248207936. Its totient is φ = 4207589280.
The previous prime is 12623435893. The next prime is 12623435917. The reversal of 12623435898 is 89853432621.
It is a happy number.
12623435898 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×126234358982 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12623435898.
It is not an unprimeable number, because it can be changed into a prime (12623435893) 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 7 ways as a sum of consecutive naturals, for example, 101115 + ... + 188337.
It is an arithmetic number, because the mean of its divisors is an integer number (1578012996).
Almost surely, 212623435898 is an apocalyptic number.
12623435898 is an abundant number, since it is smaller than the sum of its proper divisors (12624772038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12623435898 is a wasteful number, since it uses less digits than its factorization.
12623435898 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111349.
The product of its digits is 2488320, while the sum is 51.
The spelling of 12623435898 in words is "twelve billion, six hundred twenty-three million, four hundred thirty-five thousand, eight hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •