Base | Representation |
---|---|
bin | 11100000011111001011100… |
… | …011011100001011111011000 |
3 | 121011222011212222201202111120 |
4 | 130003321130123201133120 |
5 | 112134000103044032300 |
6 | 1114251114141525240 |
7 | 34665206453053110 |
oct | 3403713433413730 |
9 | 534864788652446 |
10 | 123413141002200 |
11 | 363612457a3785 |
12 | 11a12363273820 |
13 | 53b2a69c3814a |
14 | 22693294ba040 |
15 | e403d42983a0 |
hex | 703e5c6e17d8 |
123413141002200 has 384 divisors, whose sum is σ = 476118115776000. Its totient is φ = 25802529177600.
The previous prime is 123413141002199. The next prime is 123413141002211. The reversal of 123413141002200 is 2200141314321.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 24350121 + ... + 28978520.
It is an arithmetic number, because the mean of its divisors is an integer number (1239890926500).
Almost surely, 2123413141002200 is an apocalyptic number.
123413141002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123413141002200 is an abundant number, since it is smaller than the sum of its proper divisors (352704974773800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123413141002200 is a wasteful number, since it uses less digits than its factorization.
123413141002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53328715 (or 53328706 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 123413141002200 its reverse (2200141314321), we get a palindrome (125613282316521).
The spelling of 123413141002200 in words is "one hundred twenty-three trillion, four hundred thirteen billion, one hundred forty-one million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •