Base | Representation |
---|---|
bin | 11111110111011100000… |
… | …011000100100101011111 |
3 | 21202100100000202110000000 |
4 | 133313130003010211133 |
5 | 241334233004141044 |
6 | 4353554415505343 |
7 | 314132014061100 |
oct | 37673403044537 |
9 | 7670300673000 |
10 | 2189830146399 |
11 | 77477a0354a5 |
12 | 2b44a1828253 |
13 | 12b66693559c |
14 | 77dba0363a7 |
15 | 3be686e1d69 |
hex | 1fddc0c495f |
2189830146399 has 96 divisors (see below), whose sum is σ = 3883089650880. Its totient is φ = 1230814206720.
The previous prime is 2189830146397. The next prime is 2189830146401. The reversal of 2189830146399 is 9936410389812.
2189830146399 is a `hidden beast` number, since 2 + 1 + 8 + 9 + 83 + 0 + 1 + 463 + 99 = 666.
It is an interprime number because it is at equal distance from previous prime (2189830146397) and next prime (2189830146401).
It is not a de Polignac number, because 2189830146399 - 21 = 2189830146397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2189830146397) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 6369447 + ... + 6704439.
It is an arithmetic number, because the mean of its divisors is an integer number (40448850530).
Almost surely, 22189830146399 is an apocalyptic number.
2189830146399 is a deficient number, since it is larger than the sum of its proper divisors (1693259504481).
2189830146399 is an frugal number, since it uses more digits than its factorization.
2189830146399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335089 (or 335064 counting only the distinct ones).
The product of its (nonzero) digits is 20155392, while the sum is 63.
The spelling of 2189830146399 in words is "two trillion, one hundred eighty-nine billion, eight hundred thirty million, one hundred forty-six thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •