Base | Representation |
---|---|
bin | 1000110010101001011… |
… | …1011110010111000101 |
3 | 112102211212100021201202 |
4 | 2030222113132113011 |
5 | 4433304332331401 |
6 | 153215004432245 |
7 | 13624531234454 |
oct | 2145227362705 |
9 | 472755307652 |
10 | 151034652101 |
11 | 5906513a633 |
12 | 25331248685 |
13 | 1131ca2cc38 |
14 | 744ad5cb9b |
15 | 3dde85806b |
hex | 232a5de5c5 |
151034652101 has 8 divisors (see below), whose sum is σ = 155992371480. Its totient is φ = 146155007232.
The previous prime is 151034652073. The next prime is 151034652127. The reversal of 151034652101 is 101256430151.
It can be written as a sum of positive squares in 4 ways, for example, as 16294267201 + 134740384900 = 127649^2 + 367070^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151034652101 is a prime.
It is a super-2 number, since 2×1510346521012 (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 not an unprimeable number, because it can be changed into a prime (151054652101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19514696 + ... + 19522433.
It is an arithmetic number, because the mean of its divisors is an integer number (19499046435).
Almost surely, 2151034652101 is an apocalyptic number.
It is an amenable number.
151034652101 is a deficient number, since it is larger than the sum of its proper divisors (4957719379).
151034652101 is an equidigital number, since it uses as much as digits as its factorization.
151034652101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39037255.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 151034652101 in words is "one hundred fifty-one billion, thirty-four million, six hundred fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •