Base | Representation |
---|---|
bin | 1001010111110101101100… |
… | …0100110000000110001110 |
3 | 1100111011101221021210100010 |
4 | 2111331123010300012032 |
5 | 2322314424023442332 |
6 | 33530042253214050 |
7 | 2112344223051321 |
oct | 225753304600616 |
9 | 40434357253303 |
10 | 10305154515342 |
11 | 3313434083a55 |
12 | 11a525b491326 |
13 | 599a05b35bbb |
14 | 278ab4a747b8 |
15 | 12d0d9dca9cc |
hex | 95f5b13018e |
10305154515342 has 32 divisors (see below), whose sum is σ = 21936935061504. Its totient is φ = 3216062998400.
The previous prime is 10305154515319. The next prime is 10305154515347. The reversal of 10305154515342 is 24351545150301.
It is a super-2 number, since 2×103051545153422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10305154515342.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10305154515347) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 264459384 + ... + 264498347.
It is an arithmetic number, because the mean of its divisors is an integer number (685529220672).
Almost surely, 210305154515342 is an apocalyptic number.
10305154515342 is an abundant number, since it is smaller than the sum of its proper divisors (11631780546162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10305154515342 is a wasteful number, since it uses less digits than its factorization.
10305154515342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528957944.
The product of its (nonzero) digits is 180000, while the sum is 39.
Adding to 10305154515342 its reverse (24351545150301), we get a palindrome (34656699665643).
The spelling of 10305154515342 in words is "ten trillion, three hundred five billion, one hundred fifty-four million, five hundred fifteen thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •