Base | Representation |
---|---|
bin | 111111100111110010… |
… | …110101011100010011 |
3 | 20112022212122212211000 |
4 | 333213302311130103 |
5 | 2104401210404220 |
6 | 51214400353043 |
7 | 4635604041060 |
oct | 774762653423 |
9 | 215285585730 |
10 | 68313372435 |
11 | 26a761328a0 |
12 | 112a6015783 |
13 | 6598ba0989 |
14 | 3440a11c67 |
15 | 1b9c4ee390 |
hex | fe7cb5713 |
68313372435 has 128 divisors (see below), whose sum is σ = 152521574400. Its totient is φ = 28182159360.
The previous prime is 68313372427. The next prime is 68313372443. The reversal of 68313372435 is 53427331386.
68313372435 is a `hidden beast` number, since 6 + 83 + 133 + 7 + 2 + 435 = 666.
It is an interprime number because it is at equal distance from previous prime (68313372427) and next prime (68313372443).
It is not a de Polignac number, because 68313372435 - 23 = 68313372427 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 1400131 + ... + 1448099.
It is an arithmetic number, because the mean of its divisors is an integer number (1191574800).
Almost surely, 268313372435 is an apocalyptic number.
68313372435 is an abundant number, since it is smaller than the sum of its proper divisors (84208201965).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68313372435 is a wasteful number, since it uses less digits than its factorization.
68313372435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48138 (or 48132 counting only the distinct ones).
The product of its digits is 1088640, while the sum is 45.
The spelling of 68313372435 in words is "sixty-eight billion, three hundred thirteen million, three hundred seventy-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •