Base | Representation |
---|---|
bin | 10010110110110001… |
… | …01001101001011010 |
3 | 222010111102221112020 |
4 | 21123120221221122 |
5 | 131213004421130 |
6 | 4352301355310 |
7 | 505601061660 |
oct | 113330515132 |
9 | 28114387466 |
10 | 10123123290 |
11 | 432526a3a5 |
12 | 1b66268b36 |
13 | c54368ba7 |
14 | 6c0652c30 |
15 | 3e3acde10 |
hex | 25b629a5a |
10123123290 has 32 divisors (see below), whose sum is σ = 27766281600. Its totient is φ = 2313856704.
The previous prime is 10123123289. The next prime is 10123123321. The reversal of 10123123290 is 9232132101.
10123123290 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 10123123290.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 24102465 + ... + 24102884.
It is an arithmetic number, because the mean of its divisors is an integer number (867696300).
Almost surely, 210123123290 is an apocalyptic number.
10123123290 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10123123290 is an abundant number, since it is smaller than the sum of its proper divisors (17643158310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10123123290 is a wasteful number, since it uses less digits than its factorization.
10123123290 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48205366.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 10123123290 its reverse (9232132101), we get a palindrome (19355255391).
The spelling of 10123123290 in words is "ten billion, one hundred twenty-three million, one hundred twenty-three thousand, two hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •