Base | Representation |
---|---|
bin | 101111100000101111… |
… | …0010111010100000110 |
3 | 100202100122211201020011 |
4 | 1133001132113110012 |
5 | 3132424213212220 |
6 | 114512205300434 |
7 | 10241255323000 |
oct | 1370136272406 |
9 | 322318751204 |
10 | 102030210310 |
11 | 3a2a8437166 |
12 | 1793586471a |
13 | 9810303712 |
14 | 4d1c941370 |
15 | 29c25b865a |
hex | 17c1797506 |
102030210310 has 64 divisors (see below), whose sum is σ = 215716032000. Its totient is φ = 34729956576.
The previous prime is 102030210283. The next prime is 102030210313. The reversal of 102030210310 is 13012030201.
It is a super-2 number, since 2×1020302103102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102030210313) 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, 369769 + ... + 583771.
It is an arithmetic number, because the mean of its divisors is an integer number (3370563000).
Almost surely, 2102030210310 is an apocalyptic number.
102030210310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102030210310 is an abundant number, since it is smaller than the sum of its proper divisors (113685821690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102030210310 is a wasteful number, since it uses less digits than its factorization.
102030210310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214170 (or 214156 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 102030210310 its reverse (13012030201), we get a palindrome (115042240511).
The spelling of 102030210310 in words is "one hundred two billion, thirty million, two hundred ten thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •