Base | Representation |
---|---|
bin | 101110101011000101… |
… | …1100100011010100000 |
3 | 100120201012122201002011 |
4 | 1131112023210122200 |
5 | 3120232402333440 |
6 | 114013423202304 |
7 | 10145536654363 |
oct | 1352613443240 |
9 | 316635581064 |
10 | 100230121120 |
11 | 39564321548 |
12 | 17512a46394 |
13 | 95b43b1b9c |
14 | 4bcb8440da |
15 | 29195439ea |
hex | 17562e46a0 |
100230121120 has 24 divisors (see below), whose sum is σ = 236793661524. Its totient is φ = 40092048384.
The previous prime is 100230121111. The next prime is 100230121151. The reversal of 100230121120 is 21121032001.
It can be written as a sum of positive squares in 2 ways, for example, as 95177186064 + 5052935056 = 308508^2 + 71084^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 100230121120.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 313218969 + ... + 313219288.
Almost surely, 2100230121120 is an apocalyptic number.
100230121120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100230121120 is an abundant number, since it is smaller than the sum of its proper divisors (136563540404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100230121120 is an equidigital number, since it uses as much as digits as its factorization.
100230121120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626438272 (or 626438264 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100230121120 its reverse (21121032001), we get a palindrome (121351153121).
The spelling of 100230121120 in words is "one hundred billion, two hundred thirty million, one hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •