Base | Representation |
---|---|
bin | 11110001000011011000… |
… | …11100101110110001010 |
3 | 10122222022211222112220220 |
4 | 33010031203211312022 |
5 | 113430311011132302 |
6 | 2111341131530510 |
7 | 134541026331120 |
oct | 17041543456612 |
9 | 3588284875826 |
10 | 1035314552202 |
11 | 36a09008a727 |
12 | 1487988b9a36 |
13 | 76825713b88 |
14 | 38176633910 |
15 | 1bde6c2c4bc |
hex | f10d8e5d8a |
1035314552202 has 64 divisors (see below), whose sum is σ = 2415019380480. Its totient is φ = 289749118464.
The previous prime is 1035314552197. The next prime is 1035314552257. The reversal of 1035314552202 is 2022554135301.
1035314552202 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
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, 985174 + ... + 1743902.
It is an arithmetic number, because the mean of its divisors is an integer number (37734677820).
Almost surely, 21035314552202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1035314552202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1207509690240).
1035314552202 is an abundant number, since it is smaller than the sum of its proper divisors (1379704828278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1035314552202 is a wasteful number, since it uses less digits than its factorization.
1035314552202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 759407.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 1035314552202 its reverse (2022554135301), we get a palindrome (3057868687503).
The spelling of 1035314552202 in words is "one trillion, thirty-five billion, three hundred fourteen million, five hundred fifty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •