Base | Representation |
---|---|
bin | 1000110010101000111… |
… | …1000001001011010011 |
3 | 112102211201011200000010 |
4 | 2030222033001023103 |
5 | 4433303300413121 |
6 | 153214445130003 |
7 | 13624503343014 |
oct | 2145217011323 |
9 | 472751150003 |
10 | 151032435411 |
11 | 59063966160 |
12 | 25330559903 |
13 | 1131c434ca0 |
14 | 744a94300b |
15 | 3dde56b376 |
hex | 232a3c12d3 |
151032435411 has 16 divisors (see below), whose sum is σ = 236582277120. Its totient is φ = 84493669920.
The previous prime is 151032435409. The next prime is 151032435427. The reversal of 151032435411 is 114534230151.
It is not a de Polignac number, because 151032435411 - 21 = 151032435409 is a prime.
It is not an unprimeable number, because it can be changed into a prime (151032435461) 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 15 ways as a sum of consecutive naturals, for example, 176028051 + ... + 176028908.
It is an arithmetic number, because the mean of its divisors is an integer number (14786392320).
Almost surely, 2151032435411 is an apocalyptic number.
151032435411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
151032435411 is a deficient number, since it is larger than the sum of its proper divisors (85549841709).
151032435411 is a wasteful number, since it uses less digits than its factorization.
151032435411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352056986.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 151032435411 its reverse (114534230151), we get a palindrome (265566665562).
The spelling of 151032435411 in words is "one hundred fifty-one billion, thirty-two million, four hundred thirty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •