Base | Representation |
---|---|
bin | 1001010111100011011100… |
… | …0011100011001011010101 |
3 | 1100110200202111110111010220 |
4 | 2111320313003203023111 |
5 | 2322224410321100310 |
6 | 33523512201104553 |
7 | 2112111633031251 |
oct | 225706703431325 |
9 | 40420674414126 |
10 | 10300255253205 |
11 | 331134a621885 |
12 | 11a4312788159 |
13 | 599404b18918 |
14 | 27876c117261 |
15 | 12cdeec22670 |
hex | 95e370e32d5 |
10300255253205 has 8 divisors (see below), whose sum is σ = 16480408405152. Its totient is φ = 5493469468368.
The previous prime is 10300255253173. The next prime is 10300255253207. The reversal of 10300255253205 is 50235255200301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10300255253205 - 25 = 10300255253173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10300255253207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 343341841759 + ... + 343341841788.
It is an arithmetic number, because the mean of its divisors is an integer number (2060051050644).
Almost surely, 210300255253205 is an apocalyptic number.
10300255253205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10300255253205 is a deficient number, since it is larger than the sum of its proper divisors (6180153151947).
10300255253205 is an equidigital number, since it uses as much as digits as its factorization.
10300255253205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686683683555.
The product of its (nonzero) digits is 45000, while the sum is 33.
The spelling of 10300255253205 in words is "ten trillion, three hundred billion, two hundred fifty-five million, two hundred fifty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •