Base | Representation |
---|---|
bin | 10111011011001010000100… |
… | …000100000111000110001010 |
3 | 111111202201222121121111201201 |
4 | 113123022010010013012022 |
5 | 102000400111103411020 |
6 | 1003035155445334414 |
7 | 30462020611654510 |
oct | 2733120404070612 |
9 | 444681877544651 |
10 | 103021301232010 |
11 | 2a90a0a7870827 |
12 | b67a27540740a |
13 | 4563b36aca435 |
14 | 1b62386b524b0 |
15 | bd9c49114a0a |
hex | 5db28410718a |
103021301232010 has 64 divisors (see below), whose sum is σ = 212832026357760. Its totient is φ = 35171195492160.
The previous prime is 103021301231977. The next prime is 103021301232013. The reversal of 103021301232010 is 10232103120301.
It is a super-2 number, since 2×1030213012320102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103021301232013) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 232844617 + ... + 233286643.
It is an arithmetic number, because the mean of its divisors is an integer number (3325500411840).
Almost surely, 2103021301232010 is an apocalyptic number.
103021301232010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103021301232010 is an abundant number, since it is smaller than the sum of its proper divisors (109810725125750).
103021301232010 is a wasteful number, since it uses less digits than its factorization.
103021301232010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456211.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103021301232010 its reverse (10232103120301), we get a palindrome (113253404352311).
The spelling of 103021301232010 in words is "one hundred three trillion, twenty-one billion, three hundred one million, two hundred thirty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •