Base | Representation |
---|---|
bin | 1011001100000010011010… |
… | …1011001110001010100001 |
3 | 1121120000011011120212001002 |
4 | 2303000212223032022201 |
5 | 3103021314402401121 |
6 | 42055111252321345 |
7 | 2406515013645032 |
oct | 263004653161241 |
9 | 47500134525032 |
10 | 12301435200161 |
11 | 3a13011522238 |
12 | 1468125913255 |
13 | 6b3035972b53 |
14 | 30756d596a89 |
15 | 164ec65c8e0b |
hex | b3026ace2a1 |
12301435200161 has 8 divisors (see below), whose sum is σ = 12332913387648. Its totient is φ = 12269961000000.
The previous prime is 12301435199971. The next prime is 12301435200167. The reversal of 12301435200161 is 16100253410321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12301435200161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12301435200167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5231036 + ... + 7208786.
It is an arithmetic number, because the mean of its divisors is an integer number (1541614173456).
Almost surely, 212301435200161 is an apocalyptic number.
It is an amenable number.
12301435200161 is a deficient number, since it is larger than the sum of its proper divisors (31478187487).
12301435200161 is a wasteful number, since it uses less digits than its factorization.
12301435200161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1993663.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 12301435200161 its reverse (16100253410321), we get a palindrome (28401688610482).
The spelling of 12301435200161 in words is "twelve trillion, three hundred one billion, four hundred thirty-five million, two hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •