Base | Representation |
---|---|
bin | 11110001000001101101… |
… | …10101011011010001110 |
3 | 10122222001000102011101000 |
4 | 33010012312223122032 |
5 | 113430043220141324 |
6 | 2111322034001130 |
7 | 134535162536361 |
oct | 17040666533216 |
9 | 3588030364330 |
10 | 1035202115214 |
11 | 36a0326740a3 |
12 | 1487671161a6 |
13 | 76808337507 |
14 | 381657260d8 |
15 | 1bddbe1c9c9 |
hex | f106dab68e |
1035202115214 has 64 divisors (see below), whose sum is σ = 2401891430400. Its totient is φ = 329868814176.
The previous prime is 1035202115201. The next prime is 1035202115263. The reversal of 1035202115214 is 4125112025301.
It is a happy number.
1035202115214 is a `hidden beast` number, since 1 + 0 + 3 + 520 + 2 + 115 + 21 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1856547 + ... + 2348865.
It is an arithmetic number, because the mean of its divisors is an integer number (37529553600).
Almost surely, 21035202115214 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1035202115214, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1200945715200).
1035202115214 is an abundant number, since it is smaller than the sum of its proper divisors (1366689315186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1035202115214 is a wasteful number, since it uses less digits than its factorization.
1035202115214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494046 (or 494040 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 1035202115214 in words is "one trillion, thirty-five billion, two hundred two million, one hundred fifteen thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •