Base | Representation |
---|---|
bin | 1000110010100100100… |
… | …1111111101111110110 |
3 | 112102210110010101222210 |
4 | 2030221021333233312 |
5 | 4433234132412442 |
6 | 153213001234250 |
7 | 13624163503314 |
oct | 2145111775766 |
9 | 472713111883 |
10 | 151014341622 |
11 | 59054728011 |
12 | 25326492986 |
13 | 1131876b3c1 |
14 | 74483930b4 |
15 | 3ddcb9519c |
hex | 232927fbf6 |
151014341622 has 16 divisors (see below), whose sum is σ = 319795076592. Its totient is φ = 47377048320.
The previous prime is 151014341561. The next prime is 151014341623. The reversal of 151014341622 is 226143410151.
It is a super-2 number, since 2×1510143416222 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 151014341622.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151014341623) 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 in 7 ways as a sum of consecutive naturals, for example, 740266279 + ... + 740266482.
It is an arithmetic number, because the mean of its divisors is an integer number (19987192287).
Almost surely, 2151014341622 is an apocalyptic number.
151014341622 is an abundant number, since it is smaller than the sum of its proper divisors (168780734970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151014341622 is a wasteful number, since it uses less digits than its factorization.
151014341622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480532783.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 151014341622 its reverse (226143410151), we get a palindrome (377157751773).
The spelling of 151014341622 in words is "one hundred fifty-one billion, fourteen million, three hundred forty-one thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •