Base | Representation |
---|---|
bin | 11001000110110111011100… |
… | …011110100100011100110000 |
3 | 112110222100002122112112220011 |
4 | 121012313130132210130300 |
5 | 103433132312340322000 |
6 | 1030503344301024304 |
7 | 32154541130514124 |
oct | 3106673436443460 |
9 | 473870078475804 |
10 | 110423013214000 |
11 | 32203156267913 |
12 | 10474877855094 |
13 | 497cacb647396 |
14 | 1d3a706671584 |
15 | cb755167b2ba |
hex | 646ddc7a4730 |
110423013214000 has 160 divisors (see below), whose sum is σ = 267729699773952. Its totient is φ = 44049121920000.
The previous prime is 110423013213913. The next prime is 110423013214043. The reversal of 110423013214000 is 412310324011.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1142325670 + ... + 1142422330.
Almost surely, 2110423013214000 is an apocalyptic number.
110423013214000 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 110423013214000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133864849886976).
110423013214000 is an abundant number, since it is smaller than the sum of its proper divisors (157306686559952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110423013214000 is an equidigital number, since it uses as much as digits as its factorization.
110423013214000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98232 (or 98216 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 110423013214000 its reverse (412310324011), we get a palindrome (110835323538011).
The spelling of 110423013214000 in words is "one hundred ten trillion, four hundred twenty-three billion, thirteen million, two hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •