Base | Representation |
---|---|
bin | 1001001110100010100110… |
… | …1101000110110001001101 |
3 | 1022220220002020101201212022 |
4 | 2103220221231012301031 |
5 | 2312210301041140323 |
6 | 33324423234215525 |
7 | 2064660530616365 |
oct | 223505155066115 |
9 | 38826066351768 |
10 | 10145412443213 |
11 | 3261710919923 |
12 | 117a2ba1245a5 |
13 | 587929156328 |
14 | 27107d5019a5 |
15 | 128d8addb4c8 |
hex | 93a29b46c4d |
10145412443213 has 4 divisors (see below), whose sum is σ = 10288305576288. Its totient is φ = 10002519310140.
The previous prime is 10145412443171. The next prime is 10145412443227. The reversal of 10145412443213 is 31234421454101.
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 10145412443213 - 26 = 10145412443149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145412443273) 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, 71446566431 + ... + 71446566572.
It is an arithmetic number, because the mean of its divisors is an integer number (2572076394072).
Almost surely, 210145412443213 is an apocalyptic number.
It is an amenable number.
10145412443213 is a deficient number, since it is larger than the sum of its proper divisors (142893133075).
10145412443213 is an equidigital number, since it uses as much as digits as its factorization.
10145412443213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142893133074.
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 10145412443213 its reverse (31234421454101), we get a palindrome (41379833897314).
The spelling of 10145412443213 in words is "ten trillion, one hundred forty-five billion, four hundred twelve million, four hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •