Base | Representation |
---|---|
bin | 1110101100011100000001… |
… | …1110100000011001001010 |
3 | 2010012120000022121011210220 |
4 | 3223013000132200121022 |
5 | 4104202204403111410 |
6 | 54210123511450510 |
7 | 3255163432316163 |
oct | 353070036403112 |
9 | 63176008534726 |
10 | 16156601222730 |
11 | 5169a812089a1 |
12 | 198b311086a36 |
13 | 90273a569807 |
14 | 3dbdab2a276a |
15 | 1d040c2a3070 |
hex | eb1c07a064a |
16156601222730 has 16 divisors (see below), whose sum is σ = 38775842934624. Its totient is φ = 4308426992720.
The previous prime is 16156601222701. The next prime is 16156601222857. The reversal of 16156601222730 is 3722210665161.
It is a super-2 number, since 2×161566012227302 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 269276687016 + ... + 269276687075.
It is an arithmetic number, because the mean of its divisors is an integer number (2423490183414).
Almost surely, 216156601222730 is an apocalyptic number.
16156601222730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16156601222730 is an abundant number, since it is smaller than the sum of its proper divisors (22619241711894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16156601222730 is a wasteful number, since it uses less digits than its factorization.
16156601222730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538553374101.
The product of its (nonzero) digits is 181440, while the sum is 42.
Adding to 16156601222730 its reverse (3722210665161), we get a palindrome (19878811887891).
The spelling of 16156601222730 in words is "sixteen trillion, one hundred fifty-six billion, six hundred one million, two hundred twenty-two thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •