Base | Representation |
---|---|
bin | 10001011110101000000… |
… | …011100010001100000010 |
3 | 11020211021210110222221010 |
4 | 101132220003202030002 |
5 | 124134341013434323 |
6 | 2315441302541350 |
7 | 152530521141165 |
oct | 21365003421402 |
9 | 4224253428833 |
10 | 1201115374338 |
11 | 423432352370 |
12 | 17494b137856 |
13 | 893596bc519 |
14 | 421c4709adc |
15 | 2139caabc93 |
hex | 117a80e2302 |
1201115374338 has 32 divisors (see below), whose sum is σ = 2620688304960. Its totient is φ = 363964224960.
The previous prime is 1201115374229. The next prime is 1201115374351. The reversal of 1201115374338 is 8334735111021.
It is a super-2 number, since 2×12011153743382 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1201115374296 and 1201115374305.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2334708 + ... + 2802336.
It is an arithmetic number, because the mean of its divisors is an integer number (81896509530).
Almost surely, 21201115374338 is an apocalyptic number.
1201115374338 is an abundant number, since it is smaller than the sum of its proper divisors (1419572930622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201115374338 is a wasteful number, since it uses less digits than its factorization.
1201115374338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506562.
The product of its (nonzero) digits is 60480, while the sum is 39.
The spelling of 1201115374338 in words is "one trillion, two hundred one billion, one hundred fifteen million, three hundred seventy-four thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •