Base | Representation |
---|---|
bin | 10010110100011001… |
… | …01100111111100110 |
3 | 222002002222110012010 |
4 | 21122030230333212 |
5 | 131142410322204 |
6 | 4350310535050 |
7 | 505236621363 |
oct | 113214547746 |
9 | 28062873163 |
10 | 10103214054 |
11 | 431500128a |
12 | 1b5b667486 |
13 | c501b7b8b |
14 | 6bbb4d46a |
15 | 3e1e99d89 |
hex | 25a32cfe6 |
10103214054 has 8 divisors (see below), whose sum is σ = 20206428120. Its totient is φ = 3367738016.
The previous prime is 10103214029. The next prime is 10103214091. The reversal of 10103214054 is 45041230101.
It is a sphenic number, since it is the product of 3 distinct primes.
10103214054 is an admirable number.
It is a super-2 number, since 2×101032140542 (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 10103214054.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 841934499 + ... + 841934510.
It is an arithmetic number, because the mean of its divisors is an integer number (2525803515).
Almost surely, 210103214054 is an apocalyptic number.
10103214054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10103214054 is a wasteful number, since it uses less digits than its factorization.
10103214054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683869014.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 10103214054 its reverse (45041230101), we get a palindrome (55144444155).
The spelling of 10103214054 in words is "ten billion, one hundred three million, two hundred fourteen thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •