Base | Representation |
---|---|
bin | 10111010000101011010000… |
… | …110000000000101111100010 |
3 | 111102012212211220102122020202 |
4 | 113100223100300000233202 |
5 | 101402100004011144020 |
6 | 1001324240152105202 |
7 | 30356001654410123 |
oct | 2720532060005742 |
9 | 442185756378222 |
10 | 102301033303010 |
11 | 2a661696354093 |
12 | b582761095202 |
13 | 4510c3b6065c9 |
14 | 1b39579b4004a |
15 | bc6140a19e75 |
hex | 5d0ad0c00be2 |
102301033303010 has 16 divisors (see below), whose sum is σ = 184268070979200. Its totient is φ = 40892366424816.
The previous prime is 102301033303009. The next prime is 102301033303013. The reversal of 102301033303010 is 10303330103201.
It is a super-2 number, since 2×1023010333030102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102301033303013) 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 7 ways as a sum of consecutive naturals, for example, 3505846730 + ... + 3505875909.
It is an arithmetic number, because the mean of its divisors is an integer number (11516754436200).
Almost surely, 2102301033303010 is an apocalyptic number.
102301033303010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102301033303010 is a deficient number, since it is larger than the sum of its proper divisors (81967037676190).
102301033303010 is a wasteful number, since it uses less digits than its factorization.
102301033303010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7011724105.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 102301033303010 its reverse (10303330103201), we get a palindrome (112604363406211).
The spelling of 102301033303010 in words is "one hundred two trillion, three hundred one billion, thirty-three million, three hundred three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •