Base | Representation |
---|---|
bin | 1100101000011111000011… |
… | …0111001000001011010111 |
3 | 1211011211200000001000002210 |
4 | 3022013300313020023113 |
5 | 3310032021041014343 |
6 | 45312454301404503 |
7 | 2632331656066314 |
oct | 312076067101327 |
9 | 54154600030083 |
10 | 13889670251223 |
11 | 4475637832428 |
12 | 1683ab2569733 |
13 | 799a37341730 |
14 | 36039956dd0b |
15 | 19147edbc333 |
hex | ca1f0dc82d7 |
13889670251223 has 16 divisors (see below), whose sum is σ = 19963908201440. Its totient is φ = 8539018113024.
The previous prime is 13889670251213. The next prime is 13889670251243. The reversal of 13889670251223 is 32215207698831.
13889670251223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13889670251223 - 212 = 13889670247127 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 (13889670251213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 176444986 + ... + 176523687.
It is an arithmetic number, because the mean of its divisors is an integer number (1247744262590).
Almost surely, 213889670251223 is an apocalyptic number.
13889670251223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13889670251223 is a deficient number, since it is larger than the sum of its proper divisors (6074237950217).
13889670251223 is a wasteful number, since it uses less digits than its factorization.
13889670251223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 352969698.
The product of its (nonzero) digits is 8709120, while the sum is 57.
The spelling of 13889670251223 in words is "thirteen trillion, eight hundred eighty-nine billion, six hundred seventy million, two hundred fifty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •