Base | Representation |
---|---|
bin | 1001000111110101110001… |
… | …1110011010000101100010 |
3 | 1022111212221212020101101012 |
4 | 2101331130132122011202 |
5 | 2303314023312024302 |
6 | 33155504541340522 |
7 | 2053444121135030 |
oct | 221753436320542 |
9 | 38455855211335 |
10 | 10030300111202 |
11 | 321790aa18038 |
12 | 115bb33267742 |
13 | 579b12759bc7 |
14 | 26967d379550 |
15 | 125da009da52 |
hex | 91f5c79a162 |
10030300111202 has 8 divisors (see below), whose sum is σ = 17194800190656. Its totient is φ = 4298700047652.
The previous prime is 10030300111199. The next prime is 10030300111219. The reversal of 10030300111202 is 20211100303001.
10030300111202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 716450007943 = 10030300111202 / (1 + 0 + 0 + 3 + 0 + 3 + 0 + 0 + 1 + 1 + 1 + 2 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 358225003958 + ... + 358225003985.
It is an arithmetic number, because the mean of its divisors is an integer number (2149350023832).
Almost surely, 210030300111202 is an apocalyptic number.
10030300111202 is a deficient number, since it is larger than the sum of its proper divisors (7164500079454).
10030300111202 is an equidigital number, since it uses as much as digits as its factorization.
10030300111202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 716450007952.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10030300111202 its reverse (20211100303001), we get a palindrome (30241400414203).
The spelling of 10030300111202 in words is "ten trillion, thirty billion, three hundred million, one hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •