Base | Representation |
---|---|
bin | 1001010001110011010001… |
… | …0001000011010111000000 |
3 | 1100010020122210102110212201 |
4 | 2110130310101003113000 |
5 | 2314120004044312230 |
6 | 33410245233002544 |
7 | 2102012542042135 |
oct | 224346421032700 |
9 | 40106583373781 |
10 | 10201424213440 |
11 | 3283444021919 |
12 | 11891303b3454 |
13 | 58ccb4553335 |
14 | 273a7442658c |
15 | 12a5684415ca |
hex | 947344435c0 |
10201424213440 has 28 divisors (see below), whose sum is σ = 24292141409016. Its totient is φ = 4080569685248.
The previous prime is 10201424213371. The next prime is 10201424213503. The reversal of 10201424213440 is 4431242410201.
It is a junction number, because it is equal to n+sod(n) for n = 10201424213399 and 10201424213408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15939725014 + ... + 15939725653.
Almost surely, 210201424213440 is an apocalyptic number.
10201424213440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201424213440 is an abundant number, since it is smaller than the sum of its proper divisors (14090717195576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201424213440 is an equidigital number, since it uses as much as digits as its factorization.
10201424213440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31879450684 (or 31879450674 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 10201424213440 its reverse (4431242410201), we get a palindrome (14632666623641).
The spelling of 10201424213440 in words is "ten trillion, two hundred one billion, four hundred twenty-four million, two hundred thirteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •