Base | Representation |
---|---|
bin | 100101111011000110001… |
… | …1010001100010111111011 |
3 | 200110021110202122220112100 |
4 | 1023312030122030113323 |
5 | 1140343441124203330 |
6 | 15030232404514443 |
7 | 1045364650364532 |
oct | 113661432142773 |
9 | 20407422586470 |
10 | 5212151006715 |
11 | 172a5083a9974 |
12 | 7021969aba23 |
13 | 2ba67190a133 |
14 | 1403ab553319 |
15 | 908a77e4060 |
hex | 4bd8c68c5fb |
5212151006715 has 48 divisors (see below), whose sum is σ = 9106193581056. Its totient is φ = 2757735240000.
The previous prime is 5212151006693. The next prime is 5212151006719. The reversal of 5212151006715 is 5176001512125.
5212151006715 is a `hidden beast` number, since 5 + 2 + 121 + 510 + 0 + 6 + 7 + 15 = 666.
5212151006715 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5212151006715 - 211 = 5212151004667 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5212151006715.
It is not an unprimeable number, because it can be changed into a prime (5212151006719) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19028662 + ... + 19300628.
It is an arithmetic number, because the mean of its divisors is an integer number (189712366272).
Almost surely, 25212151006715 is an apocalyptic number.
5212151006715 is a deficient number, since it is larger than the sum of its proper divisors (3894042574341).
5212151006715 is a wasteful number, since it uses less digits than its factorization.
5212151006715 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275360 (or 275357 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 36.
The spelling of 5212151006715 in words is "five trillion, two hundred twelve billion, one hundred fifty-one million, six thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •