Base | Representation |
---|---|
bin | 1000110011001000100… |
… | …0110000110110011101 |
3 | 112110011221122022211012 |
4 | 2030302020300312131 |
5 | 4434041220412110 |
6 | 153235542505005 |
7 | 13631003261540 |
oct | 2146210606635 |
9 | 473157568735 |
10 | 151165013405 |
11 | 59121788a4a |
12 | 25368a35165 |
13 | 11340a43cc3 |
14 | 74603b4857 |
15 | 3deb008905 |
hex | 2332230d9d |
151165013405 has 16 divisors (see below), whose sum is σ = 213999504384. Its totient is φ = 100312266240.
The previous prime is 151165013399. The next prime is 151165013413. The reversal of 151165013405 is 504310561151.
It is not a de Polignac number, because 151165013405 - 210 = 151165012381 is a prime.
It is a super-2 number, since 2×1511650134052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 69660212 + ... + 69662381.
It is an arithmetic number, because the mean of its divisors is an integer number (13374969024).
Almost surely, 2151165013405 is an apocalyptic number.
It is an amenable number.
151165013405 is a deficient number, since it is larger than the sum of its proper divisors (62834490979).
151165013405 is a wasteful number, since it uses less digits than its factorization.
151165013405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139322636.
The product of its (nonzero) digits is 9000, while the sum is 32.
Adding to 151165013405 its reverse (504310561151), we get a palindrome (655475574556).
The spelling of 151165013405 in words is "one hundred fifty-one billion, one hundred sixty-five million, thirteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •