Base | Representation |
---|---|
bin | 11001000010101000011011… |
… | …011101000010101011010000 |
3 | 112102221111222021102022121111 |
4 | 121002220123131002223100 |
5 | 103413400330033031000 |
6 | 1030121540423103104 |
7 | 32124526632154132 |
oct | 3102503335025320 |
9 | 472844867368544 |
10 | 110132012002000 |
11 | 321007a670419a |
12 | 104283a3ba1a94 |
13 | 495b533c63201 |
14 | 1d2a5bc70b052 |
15 | caebbe009cba |
hex | 642a1b742ad0 |
110132012002000 has 40 divisors (see below), whose sum is σ = 266299205025672. Its totient is φ = 44052804800000.
The previous prime is 110132012001923. The next prime is 110132012002037. The reversal of 110132012002000 is 200210231011.
It can be written as a sum of positive squares in 4 ways, for example, as 511865840704 + 109620146161296 = 715448^2 + 10469964^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27533001001 + ... + 27533005000.
Almost surely, 2110132012002000 is an apocalyptic number.
110132012002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110132012002000 is an abundant number, since it is smaller than the sum of its proper divisors (156167193023672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110132012002000 is an equidigital number, since it uses as much as digits as its factorization.
110132012002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55066006024 (or 55066006008 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110132012002000 its reverse (200210231011), we get a palindrome (110332222233011).
The spelling of 110132012002000 in words is "one hundred ten trillion, one hundred thirty-two billion, twelve million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •