Base | Representation |
---|---|
bin | 1001011101100010010001… |
… | …1001010101111001110000 |
3 | 1100211112000110010100122102 |
4 | 2113120210121111321300 |
5 | 2330420341440222000 |
6 | 34043025420355532 |
7 | 2122410366006425 |
oct | 227304431257160 |
9 | 40745013110572 |
10 | 10403021414000 |
11 | 3350995422486 |
12 | 12002129a5ba8 |
13 | 5a6001737ca7 |
14 | 27d71a6add4c |
15 | 130916c103d5 |
hex | 97624655e70 |
10403021414000 has 80 divisors (see below), whose sum is σ = 25157133144000. Its totient is φ = 4160773932800.
The previous prime is 10403021413963. The next prime is 10403021414039. The reversal of 10403021414000 is 41412030401.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19231229 + ... + 19764771.
It is an arithmetic number, because the mean of its divisors is an integer number (314464164300).
Almost surely, 210403021414000 is an apocalyptic number.
10403021414000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10403021414000 is an abundant number, since it is smaller than the sum of its proper divisors (14754111730000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10403021414000 is an equidigital number, since it uses as much as digits as its factorization.
10403021414000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543315 (or 543299 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10403021414000 its reverse (41412030401), we get a palindrome (10444433444401).
The spelling of 10403021414000 in words is "ten trillion, four hundred three billion, twenty-one million, four hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •