Base | Representation |
---|---|
bin | 11110101111010000001… |
… | …10101010111110000100 |
3 | 10201222010200100101112110 |
4 | 33113220012222332010 |
5 | 114301004212104000 |
6 | 2125105500421020 |
7 | 136206440543103 |
oct | 17275006527604 |
9 | 3658120311473 |
10 | 1056161050500 |
11 | 377a08419416 |
12 | 150836247770 |
13 | 787985a1c7a |
14 | 3919310a03a |
15 | 1c716e57850 |
hex | f5e81aaf84 |
1056161050500 has 48 divisors (see below), whose sum is σ = 3075540983424. Its totient is φ = 281642946400.
The previous prime is 1056161050423. The next prime is 1056161050507. The reversal of 1056161050500 is 50501616501.
It is a super-2 number, since 2×10561610505002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (1056161050507) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 352052184 + ... + 352055183.
It is an arithmetic number, because the mean of its divisors is an integer number (64073770488).
Almost surely, 21056161050500 is an apocalyptic number.
1056161050500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1056161050500 is an abundant number, since it is smaller than the sum of its proper divisors (2019379932924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056161050500 is a wasteful number, since it uses less digits than its factorization.
1056161050500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704107389 (or 704107377 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 1056161050500 in words is "one trillion, fifty-six billion, one hundred sixty-one million, fifty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •