Base | Representation |
---|---|
bin | 1000100000110000000… |
… | …0000110010010101111 |
3 | 111222110000222212220210 |
4 | 2020030000012102233 |
5 | 4343434420143211 |
6 | 151102141313503 |
7 | 13364502351402 |
oct | 2101400062257 |
9 | 458400885823 |
10 | 146230240431 |
11 | 5701a181a80 |
12 | 24410265893 |
13 | 10a355725b2 |
14 | 7112c51d39 |
15 | 3c0cb889a6 |
hex | 220c0064af |
146230240431 has 8 divisors (see below), whose sum is σ = 212698531584. Its totient is φ = 88624388120.
The previous prime is 146230240411. The next prime is 146230240447. The reversal of 146230240431 is 134042032641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146230240431 - 214 = 146230224047 is a prime.
It is a super-2 number, since 2×1462302404312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146230240411) 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 7 ways as a sum of consecutive naturals, for example, 2215609671 + ... + 2215609736.
It is an arithmetic number, because the mean of its divisors is an integer number (26587316448).
Almost surely, 2146230240431 is an apocalyptic number.
146230240431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
146230240431 is a deficient number, since it is larger than the sum of its proper divisors (66468291153).
146230240431 is a wasteful number, since it uses less digits than its factorization.
146230240431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4431219421.
The product of its (nonzero) digits is 13824, while the sum is 30.
The spelling of 146230240431 in words is "one hundred forty-six billion, two hundred thirty million, two hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •