Base | Representation |
---|---|
bin | 10010110110100010… |
… | …11001001110011111 |
3 | 222010100212022002220 |
4 | 21123101121032133 |
5 | 131212013033043 |
6 | 4352152520423 |
7 | 505545650004 |
oct | 113321311637 |
9 | 28110768086 |
10 | 10121221023 |
11 | 4324190181 |
12 | 1b656b0113 |
13 | c53b510a4 |
14 | 6c02b98ab |
15 | 3e3855483 |
hex | 25b45939f |
10121221023 has 8 divisors (see below), whose sum is σ = 13513998000. Its totient is φ = 6737962368.
The previous prime is 10121221013. The next prime is 10121221049. The reversal of 10121221023 is 32012212101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10121221023 - 29 = 10121220511 is a prime.
It is a super-2 number, since 2×101212210232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121220993 and 10121221011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121221003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2377098 + ... + 2381351.
It is an arithmetic number, because the mean of its divisors is an integer number (1689249750).
Almost surely, 210121221023 is an apocalyptic number.
10121221023 is a deficient number, since it is larger than the sum of its proper divisors (3392776977).
10121221023 is an equidigital number, since it uses as much as digits as its factorization.
10121221023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4759161.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10121221023 its reverse (32012212101), we get a palindrome (42133433124).
The spelling of 10121221023 in words is "ten billion, one hundred twenty-one million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •