Base | Representation |
---|---|
bin | 100010001010101… |
… | …0000100001101010 |
3 | 2221220012100021000 |
4 | 1010111100201222 |
5 | 4321441022102 |
6 | 305431455430 |
7 | 40260303165 |
oct | 10425204152 |
9 | 2856170230 |
10 | 1146423402 |
11 | 539142963 |
12 | 27bb27576 |
13 | 153686157 |
14 | ac384adc |
15 | 6a9a601c |
hex | 4455086a |
1146423402 has 32 divisors (see below), whose sum is σ = 2549246400. Its totient is φ = 381895344.
The previous prime is 1146423401. The next prime is 1146423409. The reversal of 1146423402 is 2043246411.
It is a happy number.
1146423402 is a `hidden beast` number, since 1 + 14 + 642 + 3 + 4 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1146423401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90673 + ... + 102539.
It is an arithmetic number, because the mean of its divisors is an integer number (79663950).
Almost surely, 21146423402 is an apocalyptic number.
1146423402 is an abundant number, since it is smaller than the sum of its proper divisors (1402822998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1146423402 is a wasteful number, since it uses less digits than its factorization.
1146423402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13667 (or 13661 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 1146423402 is about 33858.8747893370. The cubic root of 1146423402 is about 1046.6022906345.
Adding to 1146423402 its reverse (2043246411), we get a palindrome (3189669813).
The spelling of 1146423402 in words is "one billion, one hundred forty-six million, four hundred twenty-three thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •