Base | Representation |
---|---|
bin | 11111000000100111100011… |
… | …01001100101111001000001 |
3 | 22221102222202220022011122222 |
4 | 33200103301221211321001 |
5 | 32414220033440102312 |
6 | 401010254154540425 |
7 | 20235430301622446 |
oct | 1740236151457101 |
9 | 287388686264588 |
10 | 68190955003457 |
11 | 1a800692401790 |
12 | 7793a44a37715 |
13 | 2c084c18b8650 |
14 | 12ba661acb9cd |
15 | 7d3c0ad73672 |
hex | 3e04f1a65e41 |
68190955003457 has 16 divisors (see below), whose sum is σ = 80140550884800. Its totient is φ = 57203107416000.
The previous prime is 68190955003351. The next prime is 68190955003477. The reversal of 68190955003457 is 75430055909186.
It is not a de Polignac number, because 68190955003457 - 220 = 68190953954881 is a prime.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 68190955003457.
It is not an unprimeable number, because it can be changed into a prime (68190955003477) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83222582 + ... + 84037967.
It is an arithmetic number, because the mean of its divisors is an integer number (5008784430300).
Almost surely, 268190955003457 is an apocalyptic number.
It is an amenable number.
68190955003457 is a deficient number, since it is larger than the sum of its proper divisors (11949595881343).
68190955003457 is a wasteful number, since it uses less digits than its factorization.
68190955003457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167263424.
The product of its (nonzero) digits is 40824000, while the sum is 62.
The spelling of 68190955003457 in words is "sixty-eight trillion, one hundred ninety billion, nine hundred fifty-five million, three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •