Base | Representation |
---|---|
bin | 11101100001010011100… |
… | …10100101111011111100 |
3 | 10120222010020122000011110 |
4 | 32300221302211323330 |
5 | 113104303213112200 |
6 | 2053545200322020 |
7 | 133165426506141 |
oct | 16605162457374 |
9 | 3528106560143 |
10 | 1014313410300 |
11 | 361193527a03 |
12 | 1446b7613310 |
13 | 748597bc3a8 |
14 | 371433c43c8 |
15 | 1b5b8156b50 |
hex | ec29ca5efc |
1014313410300 has 36 divisors (see below), whose sum is σ = 2934746801336. Its totient is φ = 270483576000.
The previous prime is 1014313410277. The next prime is 1014313410307. The reversal of 1014313410300 is 30143134101.
It is a super-2 number, since 2×10143134103002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014313410307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1690522051 + ... + 1690522650.
Almost surely, 21014313410300 is an apocalyptic number.
1014313410300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1014313410300 is an abundant number, since it is smaller than the sum of its proper divisors (1920433391036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1014313410300 is a wasteful number, since it uses less digits than its factorization.
1014313410300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3381044718 (or 3381044711 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1014313410300 its reverse (30143134101), we get a palindrome (1044456544401).
The spelling of 1014313410300 in words is "one trillion, fourteen billion, three hundred thirteen million, four hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •