Base | Representation |
---|---|
bin | 101111110001011001101011… |
… | …011101101100101111110110 |
3 | 1000112220122121020020200111012 |
4 | 233301121223131230233312 |
5 | 210014311432330231202 |
6 | 2022503554115312222 |
7 | 62153304346112612 |
oct | 5761315335545766 |
9 | 1015818536220435 |
10 | 210103013133302 |
11 | 60a442075a3083 |
12 | 1b693455bab672 |
13 | 9030824259143 |
14 | 39c507c038342 |
15 | 19453dca07152 |
hex | bf166b76cbf6 |
210103013133302 has 8 divisors (see below), whose sum is σ = 317241635724912. Its totient is φ = 104355801225000.
The previous prime is 210103013133301. The next prime is 210103013133323. The reversal of 210103013133302 is 203331310301012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2101030131333022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210103013133301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 347852670449 + ... + 347852671052.
It is an arithmetic number, because the mean of its divisors is an integer number (39655204465614).
Almost surely, 2210103013133302 is an apocalyptic number.
210103013133302 is a deficient number, since it is larger than the sum of its proper divisors (107138622591610).
210103013133302 is a wasteful number, since it uses less digits than its factorization.
210103013133302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695705341654.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 210103013133302 its reverse (203331310301012), we get a palindrome (413434323434314).
The spelling of 210103013133302 in words is "two hundred ten trillion, one hundred three billion, thirteen million, one hundred thirty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •