Base | Representation |
---|---|
bin | 1100001100001010110100… |
… | …0111001111011010011110 |
3 | 1202110100000012210121111212 |
4 | 3003002231013033122132 |
5 | 3224044224243220110 |
6 | 44301202433344422 |
7 | 2552230563644405 |
oct | 303025507173236 |
9 | 52410005717455 |
10 | 13403202320030 |
11 | 42a82a231a576 |
12 | 1605769408112 |
13 | 762bbb898283 |
14 | 344a0b61863c |
15 | 1839ac28ae05 |
hex | c30ad1cf69e |
13403202320030 has 16 divisors (see below), whose sum is σ = 24127574708160. Its totient is φ = 5360878587552.
The previous prime is 13403202320023. The next prime is 13403202320033. The reversal of 13403202320030 is 3002320230431.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13403202319978 and 13403202320005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13403202320033) 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, 50152625 + ... + 50419164.
It is an arithmetic number, because the mean of its divisors is an integer number (1507973419260).
Almost surely, 213403202320030 is an apocalyptic number.
13403202320030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13403202320030 is a deficient number, since it is larger than the sum of its proper divisors (10724372388130).
13403202320030 is a wasteful number, since it uses less digits than its factorization.
13403202320030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100585123.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 13403202320030 its reverse (3002320230431), we get a palindrome (16405522550461).
The spelling of 13403202320030 in words is "thirteen trillion, four hundred three billion, two hundred two million, three hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.784 sec. • engine limits •