Base | Representation |
---|---|
bin | 10011001100001001… |
… | …00110000100101010 |
3 | 222120222210220201100 |
4 | 21212010212010222 |
5 | 132044404241041 |
6 | 4422144302230 |
7 | 513206040522 |
oct | 114604460452 |
9 | 28528726640 |
10 | 10302415146 |
11 | 4407498a91 |
12 | 1bb6311976 |
13 | c8255264a |
14 | 6da3a4682 |
15 | 4046e76b6 |
hex | 26612612a |
10302415146 has 24 divisors (see below), whose sum is σ = 22370761764. Its totient is φ = 3426621120.
The previous prime is 10302415141. The next prime is 10302415171. The reversal of 10302415146 is 64151420301.
It is a happy number.
10302415146 is a `hidden beast` number, since 103 + 0 + 2 + 41 + 514 + 6 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 10297175625 + 5239521 = 101475^2 + 2289^2 .
It is a super-2 number, since 2×103024151462 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10302415141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 617985 + ... + 634436.
Almost surely, 210302415146 is an apocalyptic number.
10302415146 is an abundant number, since it is smaller than the sum of its proper divisors (12068346618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302415146 is a wasteful number, since it uses less digits than its factorization.
10302415146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252886 (or 1252883 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 10302415146 its reverse (64151420301), we get a palindrome (74453835447).
The spelling of 10302415146 in words is "ten billion, three hundred two million, four hundred fifteen thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •