Base | Representation |
---|---|
bin | 10010110100010010… |
… | …10101011101010110 |
3 | 222002001022121011122 |
4 | 21122021111131112 |
5 | 131142144044342 |
6 | 4350240003542 |
7 | 505226253464 |
oct | 113211253526 |
9 | 28061277148 |
10 | 10102331222 |
11 | 4314558a75 |
12 | 1b5b3005b2 |
13 | c4cc690a9 |
14 | 6bb99d834 |
15 | 3e1d734d2 |
hex | 25a255756 |
10102331222 has 8 divisors (see below), whose sum is σ = 15336069336. Its totient is φ = 4990308112.
The previous prime is 10102331203. The next prime is 10102331233. The reversal of 10102331222 is 22213320101.
10102331222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101023312222 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10102331222.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 30428543 + ... + 30428874.
It is an arithmetic number, because the mean of its divisors is an integer number (1917008667).
Almost surely, 210102331222 is an apocalyptic number.
10102331222 is a deficient number, since it is larger than the sum of its proper divisors (5233738114).
10102331222 is an equidigital number, since it uses as much as digits as its factorization.
10102331222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60857502.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10102331222 its reverse (22213320101), we get a palindrome (32315651323).
The spelling of 10102331222 in words is "ten billion, one hundred two million, three hundred thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •