Base | Representation |
---|---|
bin | 10010110110100010… |
… | …11001010011000001 |
3 | 222010100212022111122 |
4 | 21123101121103001 |
5 | 131212013040223 |
6 | 4352152522025 |
7 | 505545650600 |
oct | 113321312301 |
9 | 28110768448 |
10 | 10121221313 |
11 | 4324190415 |
12 | 1b656b0315 |
13 | c53b51268 |
14 | 6c02b9a37 |
15 | 3e38555c8 |
hex | 25b4594c1 |
10121221313 has 6 divisors (see below), whose sum is σ = 11773665666. Its totient is φ = 8675332512.
The previous prime is 10121221307. The next prime is 10121221349. The reversal of 10121221313 is 31312212101.
It can be written as a sum of positive squares in only one way, i.e., 9353210944 + 768010369 = 96712^2 + 27713^2 .
It is not a de Polignac number, because 10121221313 - 210 = 10121220289 is a prime.
It is a super-3 number, since 3×101212213133 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121221291 and 10121221300.
It is not an unprimeable number, because it can be changed into a prime (10121221393) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 103277720 + ... + 103277817.
It is an arithmetic number, because the mean of its divisors is an integer number (1962277611).
Almost surely, 210121221313 is an apocalyptic number.
It is an amenable number.
10121221313 is a deficient number, since it is larger than the sum of its proper divisors (1652444353).
10121221313 is an equidigital number, since it uses as much as digits as its factorization.
10121221313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206555551 (or 206555544 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10121221313 its reverse (31312212101), we get a palindrome (41433433414).
The spelling of 10121221313 in words is "ten billion, one hundred twenty-one million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •