Base | Representation |
---|---|
bin | 1000110011101110010… |
… | …0000010111011110001 |
3 | 112110120222020000120210 |
4 | 2030323210002323301 |
5 | 4434402212112210 |
6 | 153303352254333 |
7 | 13634633432322 |
oct | 2147344027361 |
9 | 473528200523 |
10 | 151323160305 |
11 | 591a2a85069 |
12 | 253b19a13a9 |
13 | 11367736155 |
14 | 74773c0449 |
15 | 3e09d46e20 |
hex | 233b902ef1 |
151323160305 has 16 divisors (see below), whose sum is σ = 243384689664. Its totient is φ = 80283141120.
The previous prime is 151323160249. The next prime is 151323160327. The reversal of 151323160305 is 503061323151.
151323160305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 151323160305 - 211 = 151323158257 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26406064 + ... + 26411793.
It is an arithmetic number, because the mean of its divisors is an integer number (15211543104).
Almost surely, 2151323160305 is an apocalyptic number.
151323160305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
151323160305 is a deficient number, since it is larger than the sum of its proper divisors (92061529359).
151323160305 is a wasteful number, since it uses less digits than its factorization.
151323160305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52818056.
The product of its (nonzero) digits is 8100, while the sum is 30.
Adding to 151323160305 its reverse (503061323151), we get a palindrome (654384483456).
The spelling of 151323160305 in words is "one hundred fifty-one billion, three hundred twenty-three million, one hundred sixty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •