Base | Representation |
---|---|
bin | 100100100111110100010… |
… | …1010010001111011010000 |
3 | 122211011212000221121000001 |
4 | 1021033220222101323100 |
5 | 1124431204341214300 |
6 | 14412134251335344 |
7 | 1026434054643613 |
oct | 111175052217320 |
9 | 18734760847001 |
10 | 5033310101200 |
11 | 1670684374617 |
12 | 6935a5451554 |
13 | 2a6840167314 |
14 | 13588367a17a |
15 | 8addbc4616a |
hex | 493e8a91ed0 |
5033310101200 has 30 divisors (see below), whose sum is σ = 12092527519094. Its totient is φ = 2013324040320.
The previous prime is 5033310101173. The next prime is 5033310101227. The reversal of 5033310101200 is 21010133305.
It is an interprime number because it is at equal distance from previous prime (5033310101173) and next prime (5033310101227).
It can be written as a sum of positive squares in 3 ways, for example, as 227288655504 + 4806021445696 = 476748^2 + 2192264^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6291637227 + ... + 6291638026.
Almost surely, 25033310101200 is an apocalyptic number.
5033310101200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5033310101200 is an abundant number, since it is smaller than the sum of its proper divisors (7059217417894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5033310101200 is a wasteful number, since it uses less digits than its factorization.
5033310101200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12583275271 (or 12583275260 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 5033310101200 its reverse (21010133305), we get a palindrome (5054320234505).
The spelling of 5033310101200 in words is "five trillion, thirty-three billion, three hundred ten million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •