Base | Representation |
---|---|
bin | 1001000110000101011110… |
… | …1011100001010010000001 |
3 | 1022102000010222200112212122 |
4 | 2101201113223201102001 |
5 | 2302320304123011033 |
6 | 33134001400534025 |
7 | 2051326106035562 |
oct | 221412753412201 |
9 | 38360128615778 |
10 | 10000154891393 |
11 | 3206050807237 |
12 | 115611b781315 |
13 | 57701a27a934 |
14 | 26801d92c169 |
15 | 1251d883ba98 |
hex | 91857ae1481 |
10000154891393 has 4 divisors (see below), whose sum is σ = 10000568983488. Its totient is φ = 9999740799300.
The previous prime is 10000154891371. The next prime is 10000154891417. The reversal of 10000154891393 is 39319845100001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10000154891393 - 212 = 10000154887297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10000154899393) 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, 207009821 + ... + 207058122.
It is an arithmetic number, because the mean of its divisors is an integer number (2500142245872).
Almost surely, 210000154891393 is an apocalyptic number.
It is an amenable number.
10000154891393 is a deficient number, since it is larger than the sum of its proper divisors (414092095).
10000154891393 is an equidigital number, since it uses as much as digits as its factorization.
10000154891393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414092094.
The product of its (nonzero) digits is 116640, while the sum is 44.
Adding to 10000154891393 its reverse (39319845100001), we get a palindrome (49319999991394).
The spelling of 10000154891393 in words is "ten trillion, one hundred fifty-four million, eight hundred ninety-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •