Base | Representation |
---|---|
bin | 10111000100010111… |
… | …01011010011100001 |
3 | 1011222002220012222021 |
4 | 23202023223103201 |
5 | 200330432140434 |
6 | 5404525541441 |
7 | 615621520504 |
oct | 134213532341 |
9 | 34862805867 |
10 | 12384646369 |
11 | 52858a0137 |
12 | 2497714881 |
13 | 1224a5b824 |
14 | 856b4713b |
15 | 4c73eecb4 |
hex | 2e22eb4e1 |
12384646369 has 8 divisors (see below), whose sum is σ = 12796045632. Its totient is φ = 11979829680.
The previous prime is 12384646363. The next prime is 12384646397. The reversal of 12384646369 is 96364648321.
12384646369 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12384646369 - 29 = 12384645857 is a prime.
It is a super-2 number, since 2×123846463692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12384646363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1641819 + ... + 1649344.
It is an arithmetic number, because the mean of its divisors is an integer number (1599505704).
Almost surely, 212384646369 is an apocalyptic number.
It is an amenable number.
12384646369 is a deficient number, since it is larger than the sum of its proper divisors (411399263).
12384646369 is an equidigital number, since it uses as much as digits as its factorization.
12384646369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3291287.
The product of its digits is 4478976, while the sum is 52.
The spelling of 12384646369 in words is "twelve billion, three hundred eighty-four million, six hundred forty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •