Base | Representation |
---|---|
bin | 100100011111100011000… |
… | …1010001110110010011100 |
3 | 122202111000101211100212000 |
4 | 1020333012022032302130 |
5 | 1124133322124431322 |
6 | 14400040145042300 |
7 | 1025235016345005 |
oct | 110770612166234 |
9 | 18674011740760 |
10 | 5015551405212 |
11 | 16640a1016467 |
12 | 69006a026390 |
13 | 2a4c6cc2329a |
14 | 134a7ad041ac |
15 | 8a6ecb553ac |
hex | 48fc628ec9c |
5015551405212 has 48 divisors (see below), whose sum is σ = 13687664659200. Its totient is φ = 1583858337840.
The previous prime is 5015551405169. The next prime is 5015551405213. The reversal of 5015551405212 is 2125041555105.
5015551405212 is a `hidden beast` number, since 5 + 0 + 1 + 5 + 551 + 40 + 52 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5015551405213) 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, 1222110864 + ... + 1222114967.
It is an arithmetic number, because the mean of its divisors is an integer number (285159680400).
Almost surely, 25015551405212 is an apocalyptic number.
It is an amenable number.
5015551405212 is an abundant number, since it is smaller than the sum of its proper divisors (8672113253988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5015551405212 is a wasteful number, since it uses less digits than its factorization.
5015551405212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2444225863 (or 2444225855 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 36.
The spelling of 5015551405212 in words is "five trillion, fifteen billion, five hundred fifty-one million, four hundred five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •