Base | Representation |
---|---|
bin | 10010110110100010… |
… | …11001010000000011 |
3 | 222010100212022020121 |
4 | 21123101121100003 |
5 | 131212013033443 |
6 | 4352152521111 |
7 | 505545650206 |
oct | 113321312003 |
9 | 28110768217 |
10 | 10121221123 |
11 | 4324190262 |
12 | 1b656b0197 |
13 | c53b51150 |
14 | 6c02b993d |
15 | 3e38554ed |
hex | 25b459403 |
10121221123 has 8 divisors (see below), whose sum is σ = 10901126768. Its totient is φ = 9341508384.
The previous prime is 10121221111. The next prime is 10121221147. The reversal of 10121221123 is 32112212101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10121221123 - 229 = 9584350211 is a prime.
It is a super-2 number, since 2×101212211232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121221097 and 10121221106.
It is not an unprimeable number, because it can be changed into a prime (10121221223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71836 + ... + 159382.
It is an arithmetic number, because the mean of its divisors is an integer number (1362640846).
Almost surely, 210121221123 is an apocalyptic number.
10121221123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10121221123 is a deficient number, since it is larger than the sum of its proper divisors (779905645).
10121221123 is an equidigital number, since it uses as much as digits as its factorization.
10121221123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96453.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10121221123 its reverse (32112212101), we get a palindrome (42233433224).
The spelling of 10121221123 in words is "ten billion, one hundred twenty-one million, two hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •