Base | Representation |
---|---|
bin | 1001011110101000111110… |
… | …1000000011000000001000 |
3 | 1100220100000010020122212121 |
4 | 2113222033220003000020 |
5 | 2331223224034100130 |
6 | 34055444552021024 |
7 | 2123651611613620 |
oct | 227521750030010 |
9 | 40810003218777 |
10 | 10422000300040 |
11 | 3358a4451746a |
12 | 1203a2a991774 |
13 | 5a7a376c2284 |
14 | 2805db10d880 |
15 | 131177ec8d7a |
hex | 97a8fa03008 |
10422000300040 has 64 divisors (see below), whose sum is σ = 26859116592000. Its totient is φ = 3565298946048.
The previous prime is 10422000300031. The next prime is 10422000300059. The reversal of 10422000300040 is 4000300022401.
It is a junction number, because it is equal to n+sod(n) for n = 10422000299987 and 10422000300023.
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 15 ways as a sum of consecutive naturals, for example, 41323534 + ... + 41574973.
It is an arithmetic number, because the mean of its divisors is an integer number (419673696750).
Almost surely, 210422000300040 is an apocalyptic number.
10422000300040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10422000300040 is an abundant number, since it is smaller than the sum of its proper divisors (16437116291960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10422000300040 is a wasteful number, since it uses less digits than its factorization.
10422000300040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82898974 (or 82898970 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 10422000300040 its reverse (4000300022401), we get a palindrome (14422300322441).
The spelling of 10422000300040 in words is "ten trillion, four hundred twenty-two billion, three hundred thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •