Base | Representation |
---|---|
bin | 1101111011011001001001… |
… | …0000100010111001111100 |
3 | 2000020000010211201222200202 |
4 | 3132312102100202321330 |
5 | 4001401044112033202 |
6 | 52323054325143032 |
7 | 3140254333060406 |
oct | 336662220427174 |
9 | 60200124658622 |
10 | 15314012221052 |
11 | 49746aa732956 |
12 | 1873b5b85aa78 |
13 | 87114a048a3c |
14 | 3ad2b8991b76 |
15 | 1b854506c802 |
hex | ded92422e7c |
15314012221052 has 6 divisors (see below), whose sum is σ = 26799521386848. Its totient is φ = 7657006110524.
The previous prime is 15314012221051. The next prime is 15314012221063. The reversal of 15314012221052 is 25012221041351.
It is a super-2 number, since 2×153140122210522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15314012221051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1914251527628 + ... + 1914251527635.
It is an arithmetic number, because the mean of its divisors is an integer number (4466586897808).
Almost surely, 215314012221052 is an apocalyptic number.
It is an amenable number.
15314012221052 is a deficient number, since it is larger than the sum of its proper divisors (11485509165796).
15314012221052 is a wasteful number, since it uses less digits than its factorization.
15314012221052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3828503055267 (or 3828503055265 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
The spelling of 15314012221052 in words is "fifteen trillion, three hundred fourteen billion, twelve million, two hundred twenty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •