Base | Representation |
---|---|
bin | 11011111111010111101101… |
… | …111110010011101010001100 |
3 | 121010212102220112111211012212 |
4 | 123333113231332103222030 |
5 | 112113400444323014200 |
6 | 1113452145014245552 |
7 | 34633554363646616 |
oct | 3377275576235214 |
9 | 533772815454185 |
10 | 123102050204300 |
11 | 36251317092902 |
12 | 119820036568b8 |
13 | 538c620440a3b |
14 | 22582573cddb6 |
15 | e372780b2035 |
hex | 6ff5edf93a8c |
123102050204300 has 36 divisors (see below), whose sum is σ = 271118485509480. Its totient is φ = 48505882465920.
The previous prime is 123102050204299. The next prime is 123102050204317. The reversal of 123102050204300 is 3402050201321.
It is a super-2 number, since 2×1231020502043002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9186713465 + ... + 9186726864.
It is an arithmetic number, because the mean of its divisors is an integer number (7531069041930).
Almost surely, 2123102050204300 is an apocalyptic number.
123102050204300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123102050204300 is an abundant number, since it is smaller than the sum of its proper divisors (148016435305180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123102050204300 is a wasteful number, since it uses less digits than its factorization.
123102050204300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18373440410 (or 18373440403 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The spelling of 123102050204300 in words is "one hundred twenty-three trillion, one hundred two billion, fifty million, two hundred four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •