Base | Representation |
---|---|
bin | 1001000110110010111000… |
… | …0011011100000100010110 |
3 | 1022110011121021210100210111 |
4 | 2101230232003130010112 |
5 | 2303020233400422220 |
6 | 33143334532313234 |
7 | 2052240103602445 |
oct | 221545603340426 |
9 | 38404537710714 |
10 | 10012341420310 |
11 | 321023478a839 |
12 | 1158560a7281a |
13 | 57820cc60ca8 |
14 | 268858222d5c |
15 | 12569d65515a |
hex | 91b2e0dc116 |
10012341420310 has 32 divisors (see below), whose sum is σ = 18365938794720. Its totient is φ = 3928583712768.
The previous prime is 10012341420281. The next prime is 10012341420317. The reversal of 10012341420310 is 1302414321001.
It is a super-2 number, since 2×100123414203102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012341420317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 754521 + ... + 4538059.
It is an arithmetic number, because the mean of its divisors is an integer number (573935587335).
Almost surely, 210012341420310 is an apocalyptic number.
10012341420310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10012341420310 is a deficient number, since it is larger than the sum of its proper divisors (8353597374410).
10012341420310 is a wasteful number, since it uses less digits than its factorization.
10012341420310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3788592.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 10012341420310 its reverse (1302414321001), we get a palindrome (11314755741311).
The spelling of 10012341420310 in words is "ten trillion, twelve billion, three hundred forty-one million, four hundred twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •