Base | Representation |
---|---|
bin | 111000010110100001… |
… | …1110110000110000101 |
3 | 102120100202012100200000 |
4 | 1300231003312012011 |
5 | 3440314324121023 |
6 | 131332112511513 |
7 | 11512603045311 |
oct | 1605503660605 |
9 | 376322170600 |
10 | 121015067013 |
11 | 4735a939a85 |
12 | 1b55384b599 |
13 | b54759b539 |
14 | 5c00096b41 |
15 | 3234161243 |
hex | 1c2d0f6185 |
121015067013 has 48 divisors (see below), whose sum is σ = 181963891200. Its totient is φ = 80370267120.
The previous prime is 121015066999. The next prime is 121015067023. The reversal of 121015067013 is 310760510121.
It is not a de Polignac number, because 121015067013 - 216 = 121015001477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121015067023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 140878578 + ... + 140879436.
It is an arithmetic number, because the mean of its divisors is an integer number (3790914400).
Almost surely, 2121015067013 is an apocalyptic number.
It is an amenable number.
121015067013 is a deficient number, since it is larger than the sum of its proper divisors (60948824187).
121015067013 is an frugal number, since it uses more digits than its factorization.
121015067013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2404 (or 2392 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
Adding to 121015067013 its reverse (310760510121), we get a palindrome (431775577134).
The spelling of 121015067013 in words is "one hundred twenty-one billion, fifteen million, sixty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •