Base | Representation |
---|---|
bin | 10011011110010111… |
… | …10110011011111001 |
3 | 222222122111212221021 |
4 | 21233023312123321 |
5 | 132403024441441 |
6 | 4445245342441 |
7 | 520043454352 |
oct | 115713663371 |
9 | 28878455837 |
10 | 10455312121 |
11 | 4485829821 |
12 | 2039567a21 |
13 | ca8127027 |
14 | 712804d29 |
15 | 412d4a3d1 |
hex | 26f2f66f9 |
10455312121 has 4 divisors (see below), whose sum is σ = 10463488000. Its totient is φ = 10447136244.
The previous prime is 10455312083. The next prime is 10455312149. The reversal of 10455312121 is 12121355401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12121355401 = 1907 ⋅6356243.
It is a cyclic number.
It is not a de Polignac number, because 10455312121 - 215 = 10455279353 is a prime.
It is a super-3 number, since 3×104553121213 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10455312151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4086021 + ... + 4088578.
It is an arithmetic number, because the mean of its divisors is an integer number (2615872000).
Almost surely, 210455312121 is an apocalyptic number.
It is an amenable number.
10455312121 is a deficient number, since it is larger than the sum of its proper divisors (8175879).
10455312121 is an equidigital number, since it uses as much as digits as its factorization.
10455312121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8175878.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 10455312121 its reverse (12121355401), we get a palindrome (22576667522).
The spelling of 10455312121 in words is "ten billion, four hundred fifty-five million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •