Base | Representation |
---|---|
bin | 1001010111100011111111… |
… | …1000110101100110001110 |
3 | 1100110201010211022011020020 |
4 | 2111320333320311212032 |
5 | 2322230211240040024 |
6 | 33523535013203010 |
7 | 2112115412426622 |
oct | 225707770654616 |
9 | 40421124264206 |
10 | 10300403440014 |
11 | 3311416235816 |
12 | 11a4354330466 |
13 | 59942973141c |
14 | 278783a8d182 |
15 | 12ce0cc44979 |
hex | 95e3fe3598e |
10300403440014 has 8 divisors (see below), whose sum is σ = 20600806880040. Its totient is φ = 3433467813336.
The previous prime is 10300403440013. The next prime is 10300403440049. The reversal of 10300403440014 is 41004430400301.
It is a sphenic number, since it is the product of 3 distinct primes.
10300403440014 is an admirable number.
It is a super-2 number, since 2×103004034400142 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10300403440013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 858366953329 + ... + 858366953340.
It is an arithmetic number, because the mean of its divisors is an integer number (2575100860005).
Almost surely, 210300403440014 is an apocalyptic number.
10300403440014 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10300403440014 is a wasteful number, since it uses less digits than its factorization.
10300403440014 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1716733906674.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 10300403440014 its reverse (41004430400301), we get a palindrome (51304833840315).
The spelling of 10300403440014 in words is "ten trillion, three hundred billion, four hundred three million, four hundred forty thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •