Base | Representation |
---|---|
bin | 1000100000001000011… |
… | …1000110101100100111 |
3 | 111222000110202111012200 |
4 | 2020002013012230213 |
5 | 4343114430224220 |
6 | 151033452545543 |
7 | 13360416051423 |
oct | 2100207065447 |
9 | 458013674180 |
10 | 146064304935 |
11 | 56a445461aa |
12 | 243847822b3 |
13 | 10a0a084303 |
14 | 70d8bb9b83 |
15 | 3bed30c890 |
hex | 22021c6b27 |
146064304935 has 24 divisors (see below), whose sum is σ = 253203381600. Its totient is φ = 77893192512.
The previous prime is 146064304933. The next prime is 146064304961. The reversal of 146064304935 is 539403460641.
146064304935 is a `hidden beast` number, since 1 + 4 + 606 + 4 + 3 + 0 + 4 + 9 + 35 = 666.
It is not a de Polignac number, because 146064304935 - 21 = 146064304933 is a prime.
It is a super-2 number, since 2×1460643049352 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146064304931) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 309366 + ... + 622764.
It is an arithmetic number, because the mean of its divisors is an integer number (10550140900).
Almost surely, 2146064304935 is an apocalyptic number.
146064304935 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
146064304935 is a deficient number, since it is larger than the sum of its proper divisors (107139076665).
146064304935 is a wasteful number, since it uses less digits than its factorization.
146064304935 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323767 (or 323764 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 45.
The spelling of 146064304935 in words is "one hundred forty-six billion, sixty-four million, three hundred four thousand, nine hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •