Base | Representation |
---|---|
bin | 1001000000001101111101… |
… | …1111111101001110100011 |
3 | 1022001100222000200022100111 |
4 | 2100003133133331032203 |
5 | 2244142334203041103 |
6 | 33015411155232151 |
7 | 2041130141403634 |
oct | 220033737751643 |
9 | 38040860608314 |
10 | 9899354346403 |
11 | 31773244a8905 |
12 | 113a6898a8657 |
13 | 56a674957242 |
14 | 2631ba43d88b |
15 | 1227891bd86d |
hex | 900df7fd3a3 |
9899354346403 has 4 divisors (see below), whose sum is σ = 10047105903880. Its totient is φ = 9751602788928.
The previous prime is 9899354346391. The next prime is 9899354346433. The reversal of 9899354346403 is 3046434539989.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9899354346403 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (67), and also a Moran number because the ratio is a prime number: 147751557409 = 9899354346403 / (9 + 8 + 9 + 9 + 3 + 5 + 4 + 3 + 4 + 6 + 4 + 0 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9899354346433) 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, 73875778638 + ... + 73875778771.
It is an arithmetic number, because the mean of its divisors is an integer number (2511776475970).
Almost surely, 29899354346403 is an apocalyptic number.
9899354346403 is a deficient number, since it is larger than the sum of its proper divisors (147751557477).
9899354346403 is a wasteful number, since it uses less digits than its factorization.
9899354346403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147751557476.
The product of its (nonzero) digits is 302330880, while the sum is 67.
The spelling of 9899354346403 in words is "nine trillion, eight hundred ninety-nine billion, three hundred fifty-four million, three hundred forty-six thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •