Base | Representation |
---|---|
bin | 110111101101010010… |
… | …0111010100000010100 |
3 | 102102210022020222220111 |
4 | 1233122210322200110 |
5 | 3430001043230100 |
6 | 130542520212404 |
7 | 11433400436113 |
oct | 1573244724024 |
9 | 372708228814 |
10 | 119631226900 |
11 | 4680a788469 |
12 | 1b22830a104 |
13 | b38698a333 |
14 | 5b0c38dc7a |
15 | 31a290e6ba |
hex | 1bda93a814 |
119631226900 has 72 divisors (see below), whose sum is σ = 263901262016. Its totient is φ = 47061907200.
The previous prime is 119631226877. The next prime is 119631226903. The reversal of 119631226900 is 9622136911.
It is a super-2 number, since 2×1196312269002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119631226903) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4213552 + ... + 4241848.
Almost surely, 2119631226900 is an apocalyptic number.
119631226900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 119631226900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131950631008).
119631226900 is an abundant number, since it is smaller than the sum of its proper divisors (144270035116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
119631226900 is a wasteful number, since it uses less digits than its factorization.
119631226900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29009 (or 29002 counting only the distinct ones).
The product of its (nonzero) digits is 34992, while the sum is 40.
The spelling of 119631226900 in words is "one hundred nineteen billion, six hundred thirty-one million, two hundred twenty-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •