Base | Representation |
---|---|
bin | 111000010110110001… |
… | …0100010011100110010 |
3 | 102120101022100010200220 |
4 | 1300231202202130302 |
5 | 3440323404104020 |
6 | 131333001153510 |
7 | 11513031326112 |
oct | 1605542423462 |
9 | 376338303626 |
10 | 121023113010 |
11 | 47364435068 |
12 | 1b55648b896 |
13 | b549157897 |
14 | 5c0118d042 |
15 | 3234c00240 |
hex | 1c2d8a2732 |
121023113010 has 16 divisors (see below), whose sum is σ = 290455471296. Its totient is φ = 32272830128.
The previous prime is 121023112979. The next prime is 121023113041. The reversal of 121023113010 is 10311320121.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (121023112979) and next prime (121023113041).
It is a Harshad number since it is a multiple of its sum of digits (15).
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 7 ways as a sum of consecutive naturals, for example, 2017051854 + ... + 2017051913.
It is an arithmetic number, because the mean of its divisors is an integer number (18153466956).
Almost surely, 2121023113010 is an apocalyptic number.
121023113010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121023113010 is an abundant number, since it is smaller than the sum of its proper divisors (169432358286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121023113010 is a wasteful number, since it uses less digits than its factorization.
121023113010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4034103777.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 121023113010 its reverse (10311320121), we get a palindrome (131334433131).
The spelling of 121023113010 in words is "one hundred twenty-one billion, twenty-three million, one hundred thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •