Base | Representation |
---|---|
bin | 1010111011111110001011… |
… | …0101101110011100001001 |
3 | 1120120121201010210001122102 |
4 | 2232333202311232130021 |
5 | 3034011024303234134 |
6 | 41324222403403145 |
7 | 2350544045426111 |
oct | 256774265563411 |
9 | 46517633701572 |
10 | 12025419196169 |
11 | 3916a516a8145 |
12 | 14227346834b5 |
13 | 692cb8a28c72 |
14 | 2d80678c6041 |
15 | 15cc1e7e937e |
hex | aefe2d6e709 |
12025419196169 has 4 divisors (see below), whose sum is σ = 12042144397440. Its totient is φ = 12008693994900.
The previous prime is 12025419196127. The next prime is 12025419196223. The reversal of 12025419196169 is 96169191452021.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12025419196169 - 228 = 12025150760713 is a prime.
It is a super-2 number, since 2×120254191961692 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12025419196969) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8362599557 + ... + 8362600994.
It is an arithmetic number, because the mean of its divisors is an integer number (3010536099360).
Almost surely, 212025419196169 is an apocalyptic number.
It is an amenable number.
12025419196169 is a deficient number, since it is larger than the sum of its proper divisors (16725201271).
12025419196169 is an equidigital number, since it uses as much as digits as its factorization.
12025419196169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16725201270.
The product of its (nonzero) digits is 2099520, while the sum is 56.
The spelling of 12025419196169 in words is "twelve trillion, twenty-five billion, four hundred nineteen million, one hundred ninety-six thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •