Base | Representation |
---|---|
bin | 100010010110110011110111… |
… | …111111001001110101101010 |
3 | 201211000010101011012110021112 |
4 | 202112303313333021311222 |
5 | 124301120033130013002 |
6 | 1253210520332510322 |
7 | 43553460236266430 |
oct | 4226636777116552 |
9 | 654003334173245 |
10 | 151101110001002 |
11 | 44166691441457 |
12 | 14b444a801b3a2 |
13 | 6640a095b6cc5 |
14 | 29454930a6d50 |
15 | 127074758e852 |
hex | 896cf7fc9d6a |
151101110001002 has 16 divisors (see below), whose sum is σ = 259137379204992. Its totient is φ = 64730892342480.
The previous prime is 151101110000987. The next prime is 151101110001053. The reversal of 151101110001002 is 200100011101151.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2227150649 + ... + 2227218492.
It is an arithmetic number, because the mean of its divisors is an integer number (16196086200312).
Almost surely, 2151101110001002 is an apocalyptic number.
151101110001002 is a deficient number, since it is larger than the sum of its proper divisors (108036269203990).
151101110001002 is a wasteful number, since it uses less digits than its factorization.
151101110001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4454371573.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 151101110001002 its reverse (200100011101151), we get a palindrome (351201121102153).
The spelling of 151101110001002 in words is "one hundred fifty-one trillion, one hundred one billion, one hundred ten million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •